perm filename W84.IN[LET,JMC] blob
sn#864708 filedate 1984-04-01 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00479 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00050 00002 ∂09-Jan-84 0947 DFH Dinner tonight
C00052 00003 ∂09-Jan-84 1009 TW Consulting professorships
C00053 00004 ∂09-Jan-84 1110 BSCOTT@SU-SCORE.ARPA
C00054 00005 ∂09-Jan-84 1326 ULLMAN@SU-SCORE.ARPA first lecture
C00057 00006 ∂09-Jan-84 1325 YM meet and talk about induction
C00058 00007 ∂09-Jan-84 1438 DFH Washington flights
C00059 00008 ∂09-Jan-84 1617 ROD
C00060 00009 ∂09-Jan-84 1724 RINDFLEISCH@SUMEX-AIM.ARPA Subdivision of New CSD Equip Increment
C00063 00010 ∂09-Jan-84 1738 STAN@SRI-AI.ARPA
C00065 00011 ∂10-Jan-84 0725 GRAVIER@CMU-CS-C.ARPA files from cmi
C00066 00012 ∂10-Jan-84 0907 DFH
C00067 00013 ∂10-Jan-84 1028 TAJNAI@SU-SCORE.ARPA Visitors to be invited to Forum
C00069 00014 ∂10-Jan-84 1139 CLT How to get a dd overhauled?
C00070 00015 ∂10-Jan-84 1140 PJB@S1-A Printing of File
C00071 00016 ∂10-Jan-84 1614 AAAI-OFFICE@SUMEX-AIM.ARPA next pres msg
C00072 00017 ∂10-Jan-84 1645 TOB
C00074 00018 ∂10-Jan-84 1649 WIEDERHOLD@SUMEX-AIM.ARPA Industrial lectureship
C00075 00019 ∂10-Jan-84 1701 DFH Washington DC?
C00076 00020 ∂11-Jan-84 0926 DFH
C00077 00021 ∂11-Jan-84 1012 BH51@CMU-CS-A
C00079 00022 ∂11-Jan-84 1058 JMC name
C00080 00023 ∂11-Jan-84 1106 ELYSE@SU-SCORE.ARPA Meeting with Gene
C00081 00024 ∂11-Jan-84 1143 KJB@SRI-AI.ARPA [John McCarthy <JMC@SU-AI>: slippage ]
C00083 00025 ∂11-Jan-84 1205 BH51@CMU-CS-A
C00085 00026 ∂11-Jan-84 1205 PACK@SU-SCORE.ARPA Meeting?
C00086 00027 ∂11-Jan-84 1218 @SU-SCORE.ARPA:BH51@CMU-CS-A
C00088 00028 ∂11-Jan-84 1315 DKANERVA@SRI-AI.ARPA
C00089 00029 ∂11-Jan-84 1404 MA mtc qual reading list
C00090 00030 ∂12-Jan-84 1810 ULLMAN@SU-SCORE.ARPA list management
C00091 00031 ∂12-Jan-84 2146 PACK@SU-SCORE.ARPA
C00092 00032 ∂12-Jan-84 2338 ULLMAN@SU-SCORE.ARPA
C00093 00033 ∂13-Jan-84 1523 @SU-SCORE.ARPA:DELAGI@SUMEX-AIM.ARPA [Penny Nii <NII@SUMEX-AIM.ARPA>: Monday Adv Arch mtg]
C00095 00034 ∂13-Jan-84 1525 DFH Security form
C00096 00035 ∂13-Jan-84 1630 BSCOTT@SU-SCORE.ARPA ARPA Update
C00098 00036 ∂13-Jan-84 1828 ULLMAN@SU-SCORE.ARPA Re: lists
C00099 00037 ∂14-Jan-84 1127 BSCOTT@SU-SCORE.ARPA Diana's Office
C00100 00038 ∂15-Jan-84 0126 ME passwords
C00101 00039 ∂15-Jan-84 2100 JMC*
C00102 00040 ∂16-Jan-84 0059 ME
C00103 00041 ∂16-Jan-84 0900 JMC*
C00104 00042 ∂16-Jan-84 0903 GOTELLI@SU-SCORE.ARPA Lutz Erbring
C00105 00043 ∂16-Jan-84 0909 DFH Livermore package
C00106 00044 ∂16-Jan-84 0917 HST lisp history
C00109 00045 ∂16-Jan-84 0945 DFH SAIL Accts./CS258
C00111 00046 ∂16-Jan-84 1211 REGES@SU-SCORE.ARPA Computer Accounts for CS 258
C00113 00047 ∂16-Jan-84 1238 CLAUER@SU-SIERRA.ARPA re: Simple database system? (from SAIL's BBOARD)
C00115 00048 ∂16-Jan-84 1256 Solomon.Datanet@MIT-MULTICS.ARPA visit
C00117 00049 ∂16-Jan-84 1324 CLT Calendar events
C00118 00050 ∂16-Jan-84 1419 KJB@SRI-AI.ARPA Dretske's talks
C00120 00051 ∂16-Jan-84 1547 CL.BOYER@UTEXAS-20.ARPA Re: manual
C00122 00052 ∂16-Jan-84 1606 JK
C00123 00053 ∂16-Jan-84 1809 REM@MIT-MC output-directed debugging/verification of software
C00125 00054 ∂16-Jan-84 1939 JK
C00126 00055 ∂17-Jan-84 0931 DFH Livermore package
C00127 00056 ∂17-Jan-84 1025 DFH More Livermore package
C00128 00057 ∂17-Jan-84 1312 AAAI-OFFICE@SUMEX-AIM.ARPA aaai-84 conference brochure
C00220 00058 ∂17-Jan-84 1835 Solomon.Datanet@MIT-MULTICS.ARPA
C00222 00059 ∂18-Jan-84 1009 AAAI-OFFICE@SUMEX-AIM.ARPA reschedule next meeting
C00224 00060 ∂18-Jan-84 1653 BSCOTT@SU-SCORE.ARPA "Learning Course"
C00226 00061 ∂18-Jan-84 1751 BSCOTT@SU-SCORE.ARPA
C00227 00062 ∂18-Jan-84 2000 JMC*
C00228 00063 ∂19-Jan-84 1508 AAAI-OFFICE@SUMEX-AIM.ARPA next meeting
C00229 00064 ∂19-Jan-84 1519 GOLUB@SU-SCORE.ARPA Meeting
C00230 00065 ∂19-Jan-84 1538 BSCOTT@SU-SCORE.ARPA ARPA Update
C00232 00066 ∂20-Jan-84 0313 TRAUB@COLUMBIA-20.ARPA Re: computational linguistics at Columbia
C00233 00067 ∂20-Jan-84 0825 WIEDERHOLD@SUMEX-AIM.ARPA Re: ARPA Update
C00234 00068 ∂20-Jan-84 0900 JMC*
C00235 00069 ∂20-Jan-84 0936 KJB@SRI-AI.ARPA Planning for next year.
C00237 00070 ∂20-Jan-84 1510 TRAUB@COLUMBIA-20.ARPA Re: computational linguistics at Columbia
C00238 00071 ∂20-Jan-84 1713 SJG dinner sometime?
C00239 00072 ∂20-Jan-84 1727 jbn@FORD-WDL1.ARPA Re: comments on 'obvious' algorithm
C00243 00073 ∂20-Jan-84 2226 JK
C00246 00074 ∂21-Jan-84 1001 CLT
C00247 00075 ∂21-Jan-84 1151 AMSLER@SRI-AI.ARPA Password Security Measures
C00249 00076 ∂21-Jan-84 1157 AMSLER@SRI-AI.ARPA
C00250 00077 ∂21-Jan-84 1602 Mailer@USC-ECLC.ARPA census
C00252 00078 ∂21-Jan-84 1644 JK
C00254 00079 ∂21-Jan-84 2110 ABADI@SU-SCORE.ARPA mtc quals
C00256 00080 ∂22-Jan-84 1018 JMC*
C00257 00081 ∂22-Jan-84 1505 @MIT-MC:RMS@MIT-OZ
C00259 00082 ∂22-Jan-84 1828 FEIGENBAUM@SUMEX-AIM.ARPA AI courses for 1984-85
C00261 00083 ∂22-Jan-84 1953 GENESERETH@SUMEX-AIM.ARPA Re: AI courses for 1984-85
C00263 00084 ∂22-Jan-84 2231 FEIGENBAUM@SUMEX-AIM.ARPA Re: AI courses for 1984-85
C00265 00085 ∂23-Jan-84 1108 EENGELMORE@SUMEX-AIM.ARPA Re: AI courses for 1984-85
C00267 00086 ∂23-Jan-84 1123 jbn@FORD-WDL1.ARPA Obviousness of words
C00271 00087 ∂23-Jan-84 1207 JJW Names for EKL manual
C00273 00088 ∂23-Jan-84 1224 JK
C00274 00089 ∂23-Jan-84 1927 CLT
C00275 00090 ∂23-Jan-84 2000 JMC*
C00276 00091 ∂24-Jan-84 1203 AAAI-OFFICE@SUMEX-AIM.ARPA lunch
C00277 00092 ∂24-Jan-84 1208 LENAT@SU-SCORE.ARPA Re: AI courses for 1984-85
C00278 00093 ∂24-Jan-84 1325 KJB@SRI-AI.ARPA newsletter
C00279 00094 ∂24-Jan-84 1600 CS.SIMMONS@UTEXAS-20.ARPA Circumscription
C00283 00095 ∂24-Jan-84 2352 FEIGENBAUM@SUMEX-AIM.ARPA Re: AI courses for 1984-85
C00285 00096 ∂25-Jan-84 0507 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay knowledge seminar
C00290 00097 ∂25-Jan-84 0854 EENGELMORE@SUMEX-AIM.ARPA Monday Meeting
C00291 00098 ∂25-Jan-84 2120 rsw@cmu-ri-rover Reply to Jon's remark
C00296 00099 ∂26-Jan-84 0907 NOVAK@SUMEX-AIM.ARPA I'm in PA
C00297 00100 ∂26-Jan-84 0939 AAAI-OFFICE@SUMEX-AIM.ARPA Fredkin Prize for Computer Math Discovery
C00303 00101 ∂26-Jan-84 1538 AAAI@SU-SCORE.ARPA lunch with Manuck
C00304 00102 ∂27-Jan-84 0840 GOLUB@SU-SCORE.ARPA re: Ph D Admissions (from SAIL's BBOARD)
C00306 00103 ∂27-Jan-84 1108 LOUNGO@RUTGERS.ARPA RUTGERS TECHNICAL REPORTS
C00311 00104 ∂27-Jan-84 1110 GOLUB@SU-SCORE.ARPA Re: my goof
C00312 00105 ∂27-Jan-84 1556 DFH Keith Clark
C00313 00106 ∂27-Jan-84 2152 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay knowledge seminar
C00315 00107 ∂28-Jan-84 0256 POURNE@MIT-MC
C00318 00108 ∂29-Jan-84 2305 FEIGENBAUM@SUMEX-AIM.ARPA dinner for Ben Kuipers
C00320 00109 ∂30-Jan-84 0643 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay thanks
C00322 00110 ∂30-Jan-84 0900 JMC*
C00323 00111 ∂30-Jan-84 0956 fuzzy1@aids-unix Re: knowledge seminar
C00324 00112 ∂30-Jan-84 1000 JMC*
C00325 00113 ∂30-Jan-84 1114 JK proposal
C00326 00114 ∂30-Jan-84 1119 FEIGENBAUM@SUMEX-AIM.ARPA
C00327 00115 ∂30-Jan-84 1219 JK cv
C00328 00116 ∂30-Jan-84 1446 RIEMEN@SU-SCORE.ARPA Knowledge Seminar time
C00330 00117 ∂31-Jan-84 1245 GOGUEN@SRI-AI.ARPA Re: seminar abstract
C00331 00118 ∂31-Jan-84 1542 DFH Richard Stark
C00332 00119 ∂31-Jan-84 2030 DFH* Stoyan History papers
C00333 00120 ∂31-Jan-84 2033 JJW Not me, but ...
C00335 00121 ∂01-Feb-84 1112 DFH Stark letter
C00336 00122 ∂01-Feb-84 1114 DFH Matt Nicodemus
C00337 00123 ∂01-Feb-84 1223 BUCHANAN@SUMEX-AIM.ARPA COMTEX contract
C00340 00124 ∂01-Feb-84 1245 AAAI-OFFICE@SUMEX-AIM.ARPA next lunch
C00341 00125 ∂01-Feb-84 1340 mccarty%ucbdali@Berkeley Re: knowledge seminar
C00343 00126 ∂01-Feb-84 1406 TAJNAI@SU-SCORE.ARPA Forum reply
C00344 00127 ∂01-Feb-84 1830 MULLER@SU-SCORE.ARPA CS258 - EKL - sublis.
C00346 00128 ∂01-Feb-84 1844 AAAI-OFFICE@SUMEX-AIM.ARPA UT hassles
C00351 00129 ∂02-Feb-84 0802 AAAI-OFFICE@SUMEX-AIM.ARPA
C00352 00130 ∂02-Feb-84 1332 JK proposal
C00353 00131 ∂02-Feb-84 1418 SJG
C00356 00132 ∂02-Feb-84 1520 JK proposal
C00357 00133 ∂02-Feb-84 1659 DFH Messages
C00358 00134 ∂02-Feb-84 2001 CLT*
C00359 00135 ∂03-Feb-84 0821 DKANERVA@SRI-AI.ARPA Lectures on Formalization of Commonsense Knowledge
C00361 00136 ∂03-Feb-84 1055 DKANERVA@SRI-AI.ARPA
C00363 00137 ∂03-Feb-84 1102 RINDFLEISCH@SUMEX-AIM.ARPA Symbolics Memory
C00365 00138 ∂03-Feb-84 1103 DKANERVA@SRI-AI.ARPA
C00366 00139 ∂03-Feb-84 1124 DKANERVA@SRI-AI.ARPA McCarthy Lectures on the Formalization of Commonsense Knowledge
C00368 00140 ∂03-Feb-84 1234 PACK@SU-SCORE.ARPA New prolog program
C00369 00141 ∂03-Feb-84 1300 JMC*
C00370 00142 ∂03-Feb-84 1321 BSCOTT@SU-SCORE.ARPA ARPA funds
C00372 00143 ∂03-Feb-84 1405 AAAI-OFFICE@SUMEX-AIM.ARPA FYI
C00374 00144 ∂03-Feb-84 2123 SCHREIBER@SU-SCORE.ARPA ai section of comp
C00376 00145 ∂03-Feb-84 2134 LLW@S1-A Thanks
C00380 00146 ∂03-Feb-84 2249 reid@Glacier cmu-cs-c
C00381 00147 ∂03-Feb-84 2249 reid@Glacier p.s. re: CMU system
C00382 00148 ∂04-Feb-84 1924 reid@Glacier recent bboard posting re: defense
C00383 00149 ∂05-Feb-84 1038 CLT
C00384 00150 ∂06-Feb-84 1412 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay knowledge seminar
C00388 00151 ∂06-Feb-84 1446 avg@diablo Re JMC on USSR
C00390 00152 ∂06-Feb-84 1836 SCHREIBER@SU-SCORE.ARPA Welcome to the committee.
C00392 00153 ∂06-Feb-84 1840 RPG
C00393 00154 ∂06-Feb-84 1854 RPG
C00394 00155 ∂06-Feb-84 1901 RPG
C00395 00156 ∂06-Feb-84 2008 RPG AAAI
C00396 00157 ∂07-Feb-84 1016 AAAI-OFFICE@SUMEX-AIM.ARPA update
C00399 00158 ∂07-Feb-84 1029 AAAI-OFFICE@SUMEX-AIM.ARPA
C00401 00159 ∂07-Feb-84 1617 JMC
C00402 00160 ∂07-Feb-84 2123 SJG
C00403 00161 ∂08-Feb-84 1401 JMC*
C00404 00162 ∂08-Feb-84 1423 MA Y
C00405 00163 ∂08-Feb-84 2151 GOLUB@SU-SCORE.ARPA industrial profs
C00406 00164 ∂08-Feb-84 2233 SCHREIBER@SU-SCORE.ARPA Spring Comprehensive: Hello!
C00440 00165 ∂09-Feb-84 0706 CL.BOYER@UTEXAS-20.ARPA 3600 long lines
C00441 00166 ∂09-Feb-84 0936 YEARWOOD@SU-SCORE.ARPA Courses and Degrees
C00443 00167 ∂09-Feb-84 1001 GOLUB@SU-SCORE.ARPA column
C00444 00168 ∂09-Feb-84 1209 LAMPING@SU-SCORE.ARPA Re: ai reading list
C00446 00169 ∂09-Feb-84 1509 PACK@SU-SCORE.ARPA Prolog program
C00447 00170 ∂09-Feb-84 1534 SHARON@SU-SCORE.ARPA Demo & room schedule
C00452 00171 ∂09-Feb-84 1645 SCHREIBER@SU-SCORE.ARPA Re: ai reading list
C00453 00172 ∂09-Feb-84 1650 SCHREIBER@SU-SCORE.ARPA Meeting time
C00455 00173 ∂09-Feb-84 1657 SCHREIBER@SU-SCORE.ARPA Re: ai reading list
C00457 00174 ∂09-Feb-84 1745 PETERS@SRI-AI.ARPA Meeting time
C00459 00175 ∂10-Feb-84 0703 ATP.BLEDSOE@UTEXAS-20.ARPA MCC
C00463 00176 ∂10-Feb-84 0836 GOLUB@SU-SCORE.ARPA Re: the complaint
C00464 00177 ∂10-Feb-84 0901 SCHREIBER@SU-SCORE.ARPA Re: ai reading list
C00465 00178 ∂10-Feb-84 0917 KJB@SRI-AI.ARPA Doing one thing by doing something else
C00470 00179 ∂10-Feb-84 0920 HOBBS@SRI-AI.ARPA Re: Meeting time
C00471 00180 ∂10-Feb-84 0954 Shoham@YALE Re: promise
C00473 00181 ∂10-Feb-84 0959 DFH Inference expenses
C00474 00182 ∂10-Feb-84 1018 DFH phone calls
C00475 00183 ∂10-Feb-84 1104 DFH message for Sarah
C00476 00184 ∂10-Feb-84 1252 AAAI-OFFICE@SUMEX-AIM.ARPA chapters in NW
C00478 00185 ∂11-Feb-84 0854 CLT
C00479 00186 ∂12-Feb-84 1600 JMC*
C00480 00187 ∂12-Feb-84 1659 JK class tomorrow
C00481 00188 ∂12-Feb-84 2242 JK
C00483 00189 ∂13-Feb-84 0815 DFH Stoyan/faculty club
C00484 00190 ∂13-Feb-84 1004 LAWS@SRI-AI.ARPA Re: expert systems for weather prediction
C00486 00191 ∂13-Feb-84 1016 SCHREIBER@SU-SCORE.ARPA Meeting times decided!
C00489 00192 ∂13-Feb-84 1604 ullman@diablo Shahid Mujtaba
C00491 00193 ∂13-Feb-84 1605 @MIT-MC:BERWICK.BRADFORD@MIT-OZ FORGETFUL
C00493 00194 ∂13-Feb-84 2311 HST LISP HISTORY
C00496 00195 ∂14-Feb-84 0625 @MIT-MC:PHW@MIT-OZ Wolf, Goat and Grain
C00497 00196 ∂14-Feb-84 1029 ME AP line
C00498 00197 ∂14-Feb-84 1200 greep@SU-DSN Re: riddle
C00499 00198 ∂14-Feb-84 1529 HOLTZMAN@SUMEX-AIM.ARPA Proving prescriptive theorems.
C00503 00199 ∂14-Feb-84 1602 PEDNAULT@SRI-AI.ARPA AI Research Projects
C00505 00200 ∂14-Feb-84 2000 EJH@SU-SCORE.ARPA Re: riddle
C00506 00201 ∂14-Feb-84 2210 LUNDSTROM@SU-SCORE.ARPA Discussions about potential research projects
C00512 00202 ∂15-Feb-84 0203 LENAT@SU-SCORE.ARPA Re: an idea
C00515 00203 ∂15-Feb-84 0753 LUNDSTROM@SU-SCORE.ARPA
C00516 00204 ∂15-Feb-84 1022 JK proposal
C00518 00205 ∂15-Feb-84 1155 LAMPING@SU-SCORE.ARPA Comp
C00519 00206 ∂15-Feb-84 1207 LAMPING@SU-SCORE.ARPA
C00521 00207 ∂15-Feb-84 1223 JDM Do you have a copy of ...?
C00522 00208 ∂15-Feb-84 1300 JMC*
C00523 00209 ∂15-Feb-84 1303 PETERS@SRI-AI.ARPA Areas B1 and D4 meetings
C00529 00210 ∂15-Feb-84 1515 PETERS@SRI-AI.ARPA
C00530 00211 ∂15-Feb-84 1954 LENAT@SU-SCORE.ARPA
C00534 00212 ∂15-Feb-84 2130 DFH* Stoyan bill
C00535 00213 ∂15-Feb-84 2246 Zdybel.pa@PARC-MAXC.ARPA Re: riddle
C00536 00214 ∂15-Feb-84 2316 ZM Industrial Professors
C00537 00215 ∂16-Feb-84 0019 WIEDERHOLD@SUMEX-AIM.ARPA Re: Industry lecturers
C00538 00216 ∂16-Feb-84 0506 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay knowledge seminar, Feb. 24
C00545 00217 ∂16-Feb-84 1042 cheriton@diablo Re: Industry lecturers
C00546 00218 ∂16-Feb-84 1117 cheriton@diablo Re: industry lecturer
C00547 00219 ∂16-Feb-84 1139 DFH biojmc
C00548 00220 ∂16-Feb-84 1153 HOLTZMAN@SUMEX-AIM.ARPA Proving OUGHT from ISes
C00557 00221 ∂16-Feb-84 1307 Solomon.Datanet@MIT-MULTICS.ARPA invitation to a preview
C00560 00222 ∂16-Feb-84 1408 ZM The syllabus
C00565 00223 ∂16-Feb-84 1408 ZM the resume
C00570 00224 ∂16-Feb-84 1409 ZM The letter (Please confirm receipt)
C00573 00225 ∂16-Feb-84 1554 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay message lists, etc.
C00580 00226 ∂16-Feb-84 1629 DFH I left slightly early.
C00581 00227 ∂16-Feb-84 1718 WALDINGER@SRI-AI.ARPA Industrial Lectureship
C00583 00228 ∂16-Feb-84 1756 Ellis.pa@PARC-MAXC.ARPA Re: Industry lecturers
C00588 00229 ∂16-Feb-84 2151 HAYM@SU-SCORE.ARPA CS206 Final
C00589 00230 ∂17-Feb-84 0516 SIMONDS@CMU-CS-C.ARPA Re: electronic library
C00590 00231 ∂17-Feb-84 0925 TW
C00591 00232 ∂17-Feb-84 0925 TW
C00592 00233 ∂17-Feb-84 0959 DFH lunch today
C00593 00234 ∂17-Feb-84 1014 ATP.BARBARA@UTEXAS-20.ARPA UT Situation- from Claudia Mazzetti
C00603 00235 ∂17-Feb-84 1518 PACE@USC-ECL.ARPA Re: UT Situation- from Claudia Mazzetti
C00605 00236 ∂17-Feb-84 1556 SCHREIBER@SU-SCORE.ARPA Re: AI readings
C00606 00237 ∂17-Feb-84 2125 PACK@SU-SCORE.ARPA Bird axioms
C00609 00238 ∂17-Feb-84 2308 PACK@SU-SCORE.ARPA is-a hierarchy solution?
C00616 00239 ∂18-Feb-84 1536 SHORTLIFFE@SUMEX-AIM.ARPA schedule for Kuipers visit
C00620 00240 ∂19-Feb-84 2313 HST algol history
C00622 00241 ∂20-Feb-84 1054 LENAT@SU-SCORE.ARPA Re: meeting
C00623 00242 ∂20-Feb-84 1318 WALKER@SRI-AI.ARPA Re: UT Situation- from Claudia Mazzetti
C00625 00243 ∂20-Feb-84 1622 PACK@SU-SCORE.ARPA another try
C00634 00244 ∂20-Feb-84 2050 ATP.BLEDSOE@UTEXAS-20.ARPA Re: UT Situation- from Claudia Mazzetti
C00636 00245 ∂21-Feb-84 0817 SHORTLIFFE@SUMEX-AIM.ARPA revised (final?) schedule
C00639 00246 ∂21-Feb-84 1913 LAMPING@SU-SCORE.ARPA Ai section of comp
C00641 00247 ∂21-Feb-84 2111 CLT sarah
C00642 00248 ∂21-Feb-84 2330 POURNE@MIT-MC don't forget
C00643 00249 ∂22-Feb-84 1626 BUCHANAN@SUMEX-AIM.ARPA AAAI agreement with Sci.DataLink
C00645 00250 ∂22-Feb-84 1710 rodrigue@LBL-CSAM Re: Industry lecturers
C00646 00251 ∂22-Feb-84 1740 HALPERN.SJRLVM1%IBM-SJ@Csnet-Relay knowledge seminar, once more with feeling
C00653 00252 ∂22-Feb-84 2322 HST lisp history
C00655 00253 ∂23-Feb-84 0849 AAAI-OFFICE@SUMEX-AIM.ARPA signature
C00657 00254 ∂23-Feb-84 0900 JMC*
C00658 00255 ∂23-Feb-84 1523 DFH France air reservations
C00660 00256 ∂23-Feb-84 1754 GROSOF@SUMEX-AIM.ARPA invitation to speak at CS229b
C00663 00257 ∂23-Feb-84 2001 JMC*
C00664 00258 ∂23-Feb-84 2145 PACK@SU-SCORE.ARPA hierarchy notes
C00665 00259 ∂23-Feb-84 2304 HST LISP HISTORY
C00667 00260 ∂24-Feb-84 1001 JMC*
C00668 00261 ∂24-Feb-84 1004 @MIT-MC:DAM@MIT-OZ Visit
C00672 00262 ∂24-Feb-84 1701 BERG@SU-SCORE.ARPA industry lectureship
C00674 00263 ∂24-Feb-84 2256 PACK@SU-SCORE.ARPA Prolog program
C00675 00264 ∂24-Feb-84 2336 HST lisp history
C00676 00265 ∂26-Feb-84 2349 LLW@S1-A Shackleton, Etc.
C00679 00266 ∂27-Feb-84 0811 AAAI-OFFICE@SUMEX-AIM.ARPA Re: letter to UT
C00681 00267 ∂27-Feb-84 0829 DFH While I'm away
C00682 00268 ∂27-Feb-84 1011 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- MARCH 2, 1984
C00685 00269 ∂27-Feb-84 1022 DFH phone C. Mazzetti
C00686 00270 ∂27-Feb-84 1031 BSCOTT@SU-SCORE.ARPA Umbrella Contract
C00690 00271 ∂27-Feb-84 1158 HOLTZMAN@SUMEX-AIM.ARPA MEU
C00700 00272 ∂27-Feb-84 1202 JK
C00703 00273 ∂27-Feb-84 1645 DFH
C00705 00274 ∂28-Feb-84 0116 reiter%ubc%ubc@Rand-Relay your requests
C00708 00275 ∂28-Feb-84 0750 ARK Party
C00710 00276 ∂28-Feb-84 1354 ME ap
C00711 00277 r cksummsg.msg9 WALDINGER@SRI-AI.ARPA Re: course
C00713 00278 ∂29-Feb-84 0859 HOLSTEGE@SU-SCORE.ARPA re: Talk: Interactive Computing & Work Stations (from SAIL's BBOARD)
C00716 00279 ∂29-Feb-84 0952 DKANERVA@SRI-AI.ARPA
C00718 00280 ∂29-Feb-84 1249 ME KA-10
C00719 00281 ∂29-Feb-84 1435 cheriton@diablo Industrial Lecturership course
C00724 00282 ∂29-Feb-84 1905 Ellis.pa@PARC-MAXC.ARPA Re: course
C00726 00283 ∂01-Mar-84 0236 YOM
C00727 00284 ∂01-Mar-84 0239 YOM (on TTY23 0239)
C00728 00285 ∂01-Mar-84 0918 BERG@SU-SCORE.ARPA CS400
C00730 00286 ∂01-Mar-84 1023 SJG
C00731 00287 ∂01-Mar-84 1145 BERG@SU-SCORE.ARPA
C00732 00288 ∂01-Mar-84 1220 100 (from: mlb@mc) may Gosper use your Dover?
C00734 00289 ∂01-Mar-84 1347 CL.BOYER@UTEXAS-20.ARPA Lisp Conference Conflict
C00736 00290 ∂01-Mar-84 1350 HALPERN.SJRLVM1@csnet-relay.arpa Knowledge seminar at IBM on Mar. 9, with Bob Moore and Hector Levesque
C00741 00291 ∂01-Mar-84 1702 SHARON@SU-SCORE.ARPA phone msg
C00742 00292 ∂01-Mar-84 2315 HST circumscription
C00743 00293 ∂02-Mar-84 0935 SHARON@SU-SCORE.ARPA phone msg
C00744 00294 ∂02-Mar-84 0937 SHARON@SU-SCORE.ARPA phone msg
C00745 00295 ∂02-Mar-84 1158 CLT
C00746 00296 ∂02-Mar-84 1355 SHARON@SU-SCORE.ARPA phone msgj
C00747 00297 ∂02-Mar-84 1540 PEREIRA@SRI-AI.ARPA
C00749 00298 ∂02-Mar-84 1722 SHARON@SU-SCORE.ARPA phone msg
C00750 00299 ∂03-Mar-84 1327 RESTIVO@SU-SCORE.ARPA
C00751 00300 ∂03-Mar-84 1653 FEIGENBAUM@SUMEX-AIM.ARPA [Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>: Psych courses -- cross listing with CS]
C00754 00301 ∂03-Mar-84 1653 FEIGENBAUM@SUMEX-AIM.ARPA Re: Psych courses -- cross listing with CS
C00756 00302 ∂03-Mar-84 1649 MDD
C00757 00303 ∂04-Mar-84 0900 JMC*
C00758 00304 ∂04-Mar-84 1749 VAL
C00759 00305 ∂04-Mar-84 2119 CLT
C00760 00306 ∂05-Mar-84 0917 BUCHANAN@SUMEX-AIM.ARPA Re: Rod Brooks
C00761 00307 ∂05-Mar-84 1406 JMC*
C00762 00308 ∂05-Mar-84 1406 JMC*
C00763 00309 ∂05-Mar-84 1526 RPG awards
C00764 00310 ∂05-Mar-84 1843 PEREIRA@SRI-AI.ARPA Re: Veronica Dahl
C00765 00311 ∂05-Mar-84 1919 PEREIRA@SRI-AI.ARPA
C00766 00312 ∂05-Mar-84 2309 HST circumscription
C00767 00313 ∂05-Mar-84 2314 RPG (on TTY1 2314)
C00768 00314 ∂06-Mar-84 0843 DFH phone messages
C00769 00315 ∂06-Mar-84 0908 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, March 9, 1984
C00773 00316 ∂06-Mar-84 1802 ME Prancing Pony Bill
C00774 00317 ∂06-Mar-84 1851 DE2SMITH@SUMEX-AIM.ARPA book reminder
C00776 00318 ∂06-Mar-84 2359 WALKER@SRI-AI.ARPA A major change in prospect
C00780 00319 ∂07-Mar-84 0835 RINDFLEISCH@SUMEX-AIM.ARPA Important: DARPA Strategic Computing Submissions
C00783 00320 ∂07-Mar-84 0929 AAAI-OFFICE@SUMEX-AIM.ARPA Walker
C00785 00321 ∂07-Mar-84 1141 LAMPING@SU-SCORE.ARPA Comp
C00786 00322 ∂07-Mar-84 1215 PACK@SU-SCORE.ARPA Letter of Recommendation
C00788 00323 ∂07-Mar-84 1316 MULLER@SU-SCORE.ARPA EKL - match/sublis
C00789 00324 ∂07-Mar-84 1401 JMC*
C00790 00325 ∂07-Mar-84 1753 PACK@SU-SCORE.ARPA Recommendation, again...
C00792 00326 ∂07-Mar-84 1757 PACK@SU-SCORE.ARPA
C00793 00327 ∂07-Mar-84 1802 PACK@SU-SCORE.ARPA
C00794 00328 ∂08-Mar-84 0759 JRP@SRI-AI.ARPA meeting today
C00795 00329 ∂08-Mar-84 1000 JMC*
C00796 00330 ∂08-Mar-84 1200 DFH Res. asst. money/L. Pack
C00797 00331 ∂08-Mar-84 1426 HAYM@SU-SCORE.ARPA cs206 final, compactify
C00799 00332 ∂08-Mar-84 1600 DFH ai qual
C00800 00333 ∂08-Mar-84 1605 DFH Collin Mick
C00801 00334 ∂08-Mar-84 1626 DFH Dr. Doll's lectures
C00802 00335 ∂08-Mar-84 1929 @SRI-AI.ARPA:EMAIL@SRI-KL.ARPA New SRI Phone Book
C00805 00336 ∂08-Mar-84 2005 @SRI-AI.ARPA:EMAIL@SRI-KL.ARPA New SRI Phone Book
C00809 00337 ∂09-Mar-84 1501 ME unformatted files
C00811 00338 ∂09-Mar-84 1636 DFH XGP
C00813 00339 ∂09-Mar-84 2240 FEIGENBAUM@SUMEX-AIM.ARPA Re: admissions status: whiteballs
C00817 00340 ∂09-Mar-84 2309 RPG Travel
C00820 00341 ∂09-Mar-84 2353 LAWS@SRI-AI.ARPA Beliefs of Thermostats
C00826 00342 ∂10-Mar-84 0812 reid@Glacier Re: admissions status: whiteballs
C00828 00343 ∂10-Mar-84 1000 JMC*
C00829 00344 ∂10-Mar-84 1716 PACK@SU-SCORE.ARPA Re: assistantship offer
C00831 00345 ∂11-Mar-84 0046 rsw@cmu-ri-rover tentacles
C00833 00346 ∂11-Mar-84 1445 CLT tonight
C00834 00347 ∂11-Mar-84 2227 LAWS@SRI-AI.ARPA Re: beliefs of thermostats
C00838 00348 ∂12-Mar-84 0026 reiter%ubc.csnet@csnet-relay.arpa equality
C00841 00349 ∂12-Mar-84 0557 RINDFLEISCH@SUMEX-AIM.ARPA HPP Source Qual Statement
C00844 00350 ∂12-Mar-84 1139 Solomon.Datanet@MIT-MULTICS.ARPA Ithiel
C00845 00351 ∂12-Mar-84 1207 SJG
C00847 00352 ∂12-Mar-84 1304 EMMA@SRI-AI.ARPA Mailing lists !important!
C00851 00353 ∂12-Mar-84 1304 SJG (on TTY74, at TV-102 1304)
C00852 00354 ∂12-Mar-84 1312 ZAUDERER@SU-SCORE.ARPA Individual Comp. Comm. Mtg with R. Schreiber
C00854 00355 ∂12-Mar-84 1318 EMMA@SRI-AI.ARPA mailing lists !important!
C00856 00356 ∂12-Mar-84 1400 JMC*
C00857 00357 ∂12-Mar-84 1444 JK
C00859 00358 ∂12-Mar-84 1458 JK
C00861 00359 ∂12-Mar-84 1636 JK
C00863 00360 ∂12-Mar-84 1942 SJG party
C00864 00361 ∂13-Mar-84 0900 AAAI-OFFICE@SUMEX-AIM.ARPA draft of local chapters msg
C00867 00362 ∂13-Mar-84 1128 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- FRIDAY, March 16, 1984
C00871 00363 ∂13-Mar-84 1145 AAAI-OFFICE@SUMEX-AIM.ARPA presidential message
C00872 00364 ∂13-Mar-84 1244 GROSOF@SUMEX-AIM.ARPA visit to cs229b this thursday, 3/15, 9:30am, room 352
C00886 00365 ∂13-Mar-84 1424 PHY Search comm. meeting
C00887 00366 ∂13-Mar-84 1456 Solomon.Datanet@MIT-MULTICS.ARPA
C00891 00367 ∂13-Mar-84 1447 PHY
C00892 00368 ∂13-Mar-84 1512 PHY meeting
C00893 00369 ∂13-Mar-84 1652 DFH 3/13 phone messages
C00894 00370 ∂13-Mar-84 2100 SGF terminal
C00895 00371 ∂14-Mar-84 0909 AAAI-OFFICE@SUMEX-AIM.ARPA Local Chapters
C00898 00372 ∂14-Mar-84 1035 TOB
C00899 00373 ∂14-Mar-84 1107 TOB
C00900 00374 ∂14-Mar-84 1256 AAAI-OFFICE@SUMEX-AIM.ARPA [Barbara J. Grosz <GROSZ@SRI-AI.ARPA>: Re: Local Chapters]
C00904 00375 ∂14-Mar-84 1422 MDD
C00905 00376 ∂14-Mar-84 1606 AAAI@SU-SCORE.ARPA response to Pres msg
C00910 00377 ∂14-Mar-84 1610 BOSACK@SU-SCORE.ARPA Fuji Eagles for the archive machine
C00912 00378 ∂15-Mar-84 0806 PHY
C00917 00379 ∂15-Mar-84 2253 FEIGENBAUM@SUMEX-AIM.ARPA [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: McCarthy Investigation]
C00919 00380 ∂15-Mar-84 2332 HST lisp history
C00921 00381 ∂16-Mar-84 0004 HST pictures
C00922 00382 ∂16-Mar-84 0010 HST pictures
C00923 00383 ∂16-Mar-84 0605 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Local Chapters
C00926 00384 ∂16-Mar-84 0850 BUCHANAN@SUMEX-AIM.ARPA Re: Local Chapters
C00928 00385 ∂16-Mar-84 1141 YK
C00929 00386 ∂16-Mar-84 1510 SJG desks
C00930 00387 ∂16-Mar-84 1534 TAJNAI@SU-SCORE.ARPA research interests
C00934 00388 ∂16-Mar-84 2150 LLW@S1-A.ARPA PARTY!!!
C00938 00389 ∂16-Mar-84 2216 ARK For your information
C00940 00390 ∂17-Mar-84 0842 Solomon.Datanet@MIT-MULTICS.ARPA history of the computer
C00942 00391 ∂17-Mar-84 0942 MDD mail@
C00943 00392 ∂17-Mar-84 1337 CLT
C00944 00393 ∂17-Mar-84 1822 reiter%ubc.csnet@csnet-relay.arpa disjunctions
C00947 00394 ∂17-Mar-84 2113 SJG
C00949 00395 ∂17-Mar-84 2312 LLW@S1-A.ARPA Dave Poole
C00952 00396 ∂18-Mar-84 0321 ARK SAIL vs. SCORE vs. UNIX
C00955 00397 ∂18-Mar-84 0947 CLT
C00956 00398 ∂18-Mar-84 1848 SJG schedule
C00958 00399 ∂18-Mar-84 1944 PACK@SU-SCORE.ARPA Office, Admission
C00960 00400 ∂18-Mar-84 2249 ARK ∂18-Mar-84 2128 FEIGENBAUM@SUMEX-AIM.ARPA Re: For your information
C00963 00401 ∂19-Mar-84 0036 ARK FYI
C00966 00402 ∂19-Mar-84 0037 ARK FYI2
C00968 00403 ∂19-Mar-84 0944 ZAUDERER@SU-SCORE.ARPA comp. comm. mtg.
C00969 00404 ∂19-Mar-84 1108 LAMPING@SU-SCORE.ARPA
C00970 00405 ∂19-Mar-84 1109 LAMPING@SU-SCORE.ARPA Comp
C00971 00406 ∂19-Mar-84 1112 ZAUDERER@SU-SCORE.ARPA Mtg.
C00972 00407 ∂19-Mar-84 1115 LAMPING@SU-SCORE.ARPA
C00973 00408 ∂19-Mar-84 1118 GROSOF@SUMEX-AIM.ARPA circumscription
C00975 00409 ∂19-Mar-84 1137 GROSOF@SUMEX-AIM.ARPA corection
C00976 00410 ∂19-Mar-84 1354 DFH Elliott Blum called
C00977 00411 ∂19-Mar-84 1411 YAO@SU-SCORE.ARPA possible appointment
C00979 00412 ∂19-Mar-84 1539 LAMPING@SU-SCORE.ARPA
C00980 00413 ∂19-Mar-84 1621 JK proposal
C00981 00414 ∂19-Mar-84 1657 YAO@SU-SCORE.ARPA Re: cheng
C00982 00415 ∂19-Mar-84 2343 HST pictures concerning lisp history
C00983 00416 ∂20-Mar-84 1058 DFH Colin Mick phoned
C00984 00417 ∂20-Mar-84 1222 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, March 23, 1984
C00988 00418 ∂20-Mar-84 1310 PJB@S1-A.ARPA
C00989 00419 ∂20-Mar-84 1315 GROSOF@SUMEX-AIM.ARPA circumscription and default logic
C00992 00420 ∂20-Mar-84 1556 GROSOF@SUMEX-AIM.ARPA unique names and equality
C00995 00421 ∂20-Mar-84 1557 GROSOF@SUMEX-AIM.ARPA nonmon. seminar for spring
C00996 00422 ∂20-Mar-84 1712 JMC Laura Breeden
C00997 00423 ∂21-Mar-84 0022 ARK FYI
C01004 00424 ∂21-Mar-84 1102 CLT okner
C01005 00425 ∂21-Mar-84 1248 DEK T.
C01007 00426 ∂21-Mar-84 1330 ullman@diablo Re: T.
C01008 00427 ∂21-Mar-84 1628 DEK CHAIRPERSON SEARCH ENTERS CRITICAL PHASE!
C01013 00428 ∂21-Mar-84 1639 DFH phone calls
C01014 00429 ∂21-Mar-84 1816 PEREIRA@SRI-AI.ARPA [Chappell: Expenses for Victoria]
C01017 00430 ∂21-Mar-84 2106 JRP@SRI-AI.ARPA Victor Kuo
C01019 00431 ∂21-Mar-84 2252 cheriton@navajo Re: T.
C01020 00432 ∂21-Mar-84 2338 PEREIRA@SRI-AI.ARPA Re: Veronica Dahl
C01021 00433 ∂22-Mar-84 1008 DFH Prof. Slotnik called
C01022 00434 ∂22-Mar-84 1009 DFH time off
C01023 00435 ∂22-Mar-84 1146 DFH III planning comm.
C01024 00436 ∂22-Mar-84 1317 DEK date change
C01025 00437 ∂22-Mar-84 1430 STUCKY@SRI-AI.ARPA Victor Kuo
C01027 00438 ∂22-Mar-84 2130 FEIGENBAUM@SU-SCORE.ARPA review
C01028 00439 ∂23-Mar-84 Newman.ES@PARC-GW.ARPA 23-Mar-84 JMC Relative merits of US & USSR foreign policy
C01036 00440 ∂24-Mar-84 0035 GROSOF@SUMEX-AIM.ARPA nonmonotonic reasoning seminar
C01042 00441 ∂25-Mar-84 1802 SJG schedule
C01043 00442 ∂25-Mar-84 1951 SGF terminal
C01045 00443 ∂25-Mar-84 2247 FEIGENBAUM@SUMEX-AIM.ARPA SCIENCE, 23 Mar. 1984
C01047 00444 ∂26-Mar-84 0930 DKANERVA@SRI-AI.ARPA
C01048 00445 ∂26-Mar-84 0933 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT---There will be NO Siglunch on Friday, March 30≠
C01049 00446 ∂26-Mar-84 1051 DHM thanks
C01050 00447 ∂26-Mar-84 1133 BERG@SU-SCORE.ARPA grades
C01052 00448 ∂26-Mar-84 1136 AAAI-OFFICE@SUMEX-AIM.ARPA '84 AAAI budget
C01066 00449 ∂26-Mar-84 1202 CLT
C01067 00450 ∂26-Mar-84 1332 DFH
C01068 00451 ∂26-Mar-84 1413 PHY
C01069 00452 ∂26-Mar-84 1506 DEK meeting started at 2:30, can't find you!
C01070 00453 ∂26-Mar-84 2251 HST
C01071 00454 ∂27-Mar-84 1319 CL.BOYER@UTEXAS-20.ARPA Recommendation
C01072 00455 ∂27-Mar-84 1327 LAWS@SRI-AI.ARPA re: fifth generation (from SAIL's BBOARD)
C01074 00456 ∂27-Mar-84 1336 PACK@SU-SCORE.ARPA Office, next quarter
C01076 00457 ∂27-Mar-84 1400 JMC*
C01077 00458 ∂27-Mar-84 1657 DFH Dahl expenses
C01078 00459 ∂27-Mar-84 2238 LENAT@SUMEX-AIM.ARPA Citations of me
C01085 00460 ∂27-Mar-84 2243 FEIGENBAUM@SUMEX-AIM.ARPA Re: Citations of me
C01086 00461 ∂28-Mar-84 0927 perlis%umcp-cs.csnet@csnet-relay.arpa Re: determinism and choice
C01092 00462 ∂28-Mar-84 0947 ullman@diablo Re: More on Marek paper.
C01094 00463 ∂28-Mar-84 1028 LAWS@SRI-AI.ARPA
C01095 00464 ∂28-Mar-84 1058 ullman@diablo
C01097 00465 ∂28-Mar-84 1331 ME DM
C01098 00466 ∂28-Mar-84 1434 SJG employment
C01099 00467 ∂28-Mar-84 1648 @MIT-MC:Hewitt@MIT-OZ determinism and choice
C01102 00468 ∂28-Mar-84 1721 PACK@SU-SCORE.ARPA Terminals
C01103 00469 ∂28-Mar-84 1731 @MIT-MC:DAM@MIT-OZ determinism and choice
C01105 00470 ∂29-Mar-84 0620 ABOULANGER@BBNG.ARPA Re: determinism and choice
C01108 00471 ∂29-Mar-84 0636 perlis%umcp-cs.csnet@csnet-relay.arpa Re: determinism and choice
C01113 00472 ∂29-Mar-84 0900 JMC*
C01115 00473 ∂29-Mar-84 1858 CL.BOYER@UTEXAS-20.ARPA Re: 1980 lisp conference proceedings
C01118 00474 ∂29-Mar-84 1956 CL.BOYER@UTEXAS-20.ARPA Texas
C01125 00475 ∂30-Mar-84 0236 DEK party
C01126 00476 ∂30-Mar-84 0704 SCHREIBER@SU-SCORE.ARPA Meeting plan
C01128 00477 ∂30-Mar-84 0707 SCHREIBER@SU-SCORE.ARPA AI Reading list
C01129 00478 ∂30-Mar-84 0900 JMC*
C01133 00479 ∂30-Mar-84 0942 JK
C01134 ENDMK
C⊗;
∂09-Jan-84 0947 DFH Dinner tonight
with Alan Duncan of Feranti is cancelled, per call from
Thelma at Inference. Alex Jacobson will be in after 10 or
so if you want to talk with him.
∂09-Jan-84 1009 TW Consulting professorships
To: DEK@SU-AI, JMC@SU-AI, ZM@SU-AI, TW@SU-AI
CC: golub@SU-SCORE
Both Zohar and Don are out of town this week, so I think the best thing
is to delay the whole matter. We will meet sometime after Zohar gets
back (Jan 20) and present the report to one of the monthly tenured
faculty meetings.
--t
∂09-Jan-84 1110 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Jan 84 11:10:09 PST
Date: Mon 9 Jan 84 11:02:31-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Mon 9 Jan 84 11:00:00-PST
O.K., John. I'll appreciate knowing what Ohlander says.
Betty
-------
∂09-Jan-84 1326 ULLMAN@SU-SCORE.ARPA first lecture
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Jan 84 13:26:26 PST
Date: Mon 9 Jan 84 13:18:31-PST
From: Jeffrey D. Ullman <ULLMAN@SU-SCORE.ARPA>
Subject: first lecture
To: CS440: ;
We are meeting at 4:15 Thursdays again.
This time, the meeting room will be MJH 352.
The first speaker is Bruce Delagi; abstract follows.
OVERVIEW AND TOPOLOGY CONSIDERATIONS FOR CONCURRENT KNOWLEDGE BASED SYSTEMS
Expert systems, a class of knowledge based systems in the field of artificial
intelligence, have demonstrated promise in solving apparently difficult
application problems. This promise, to be fully realized, requires computer
performance beyond what can be extrapolated from circuit and materials advances
alone. The program now underway (but still in the groping about phase) at
Stanford's Heuristic Programming Project is predicated on realizing the promise
by means of moderately extensive degrees of concurrancy (say a few hundred).
This concurrency is targeted to be accomplished by nesting - multiplicatively -
modest factors at each of several levels in a computational hierarchy ranging
from a supporting topology to problem level decomposition for a few target
signal understanding applications.
The talk will define some of the concepts used in the knowledge based systems
under consideration, articulate the computational hierarchy used as a framework
in the program, and tour the design space at the bottom level of this hierarchy
- together with a rationalization for the (tentative) choices made for physical
connection topology, granularity, and low-level communication / synchronization
support.
-------
∂09-Jan-84 1325 YM meet and talk about induction
I am visiting Richard Waldinger and would beinterested to talk
to you. Will be here through thursday.
C.F. Nourani
∂09-Jan-84 1438 DFH Washington flights
There don't seem to be any direct "midnight flyers"
Latest direct flight is at 2:15 pm arriving 10 pm.
As far as connections go, one of the better ones is:
UA 136 12:10am/5:55am SFO/Chicago
UA 800 6:45am/9:23am Chicago/Washington (National)
Shall I go ahead with this or do you want me to try
something else?
∂09-Jan-84 1617 ROD
I sent a note to Dianna last week saying it is fine. I assumed she
passed it on to whoever needs to know. It will be 4:30pm, Terman
Auditorium, Tuesday Jan 24th. I need to know his citizenship/immigration
status and social security number to arrange for an honorarium.
∂09-Jan-84 1724 RINDFLEISCH@SUMEX-AIM.ARPA Subdivision of New CSD Equip Increment
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 9 Jan 84 17:24:30 PST
Date: Mon 9 Jan 84 17:28:03-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Subdivision of New CSD Equip Increment
To: BSCOTT@SU-SCORE.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
Hennessey@SU-SCORE.ARPA, CMiller@SUMEX-AIM.ARPA
In-Reply-To: Message from "Betty Scott <BSCOTT@SU-SCORE.ARPA>" of Fri 6 Jan 84 13:37:44-PST
OK, Betty, here's what I suggest for dividing up the new $950K increment
on the DARPA Equipment contract (see 1/84 column below):
6/83 1/84 Remaining
Increment Increment Increment
Formal Reasoning $224,000 135,300 0
2-FCZ780 (JMC)
CSD Equipment $393,000 384,280 579,816
2-FCZ781 (JMC)
CSL Equipment $514,000 302,795 234,783
2-FCZ782 (JLH)
HPP Equipment $484,000 127,625 0
2-FCZ783 (EAF)
---------- ---------- ----------
$1,615,000 $ 950,000 $ 814,599 $3,379,599
The 6/83 column is what we worked out previously. The 1/84 column funds
all 4 subaccounts through May 1984, in accord with the May 2, 1983
budget revision submitted to DSSW. The last column represents the funds
we expect to receive around 6/84 for contract year 2 (VAX 11/780, "large
time-shared system", and CSD-CF personnel). We are actually overfunded
by $2,700 through May 1984 -- I allocated those funds to CSD-CF.
Let me know if any of this is unclear. Tom R.
-------
∂09-Jan-84 1738 STAN@SRI-AI.ARPA
Received: from SRI-AI by SU-AI with TCP/SMTP; 9 Jan 84 17:37:55 PST
Date: Mon 9 Jan 84 17:38:50-PST
From: STAN@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
cc: stan@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Mon 9 Jan 84 17:20:00-PST
Thanks for helping to arrange Udi's talk. As far as I know, his
citizenship is Israeli. I don't know what sort of visa he is on. Ditto
for his Soc. Sec. number. He will be in the US for two weeks; we can
probably get the information from him once he gets here (he'll be at POPL
the week before he comes to Palo Alto.) --Stan
-------
∂10-Jan-84 0725 GRAVIER@CMU-CS-C.ARPA files from cmi
Received: from CMU-CS-C by SU-AI with TCP/SMTP; 10 Jan 84 07:24:59 PST
Received: ID <GRAVIER@CMU-CS-C.ARPA>; Tue 10 Jan 84 10:25:59-EST
Date: Tue 10 Jan 84 10:25:58-EST
From: GRAVIER@CMU-CS-C.ARPA
Subject: files from cmi
To: jmc@SU-AI.ARPA
hello, here are the files you asked me to transfer.
I hope you'll get what you expected.
Pierre
∂10-Jan-84 0907 DFH
I would like to leave early Fri. afternoon, about
3 pm, if it's OK with you.
∂10-Jan-84 1028 TAJNAI@SU-SCORE.ARPA Visitors to be invited to Forum
Received: from SU-SCORE by SU-AI with TCP/SMTP; 10 Jan 84 10:28:08 PST
Date: Tue 10 Jan 84 10:27:24-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Visitors to be invited to Forum
To: Ullman@SU-SCORE.ARPA, Golub@SU-SCORE.ARPA, JMC@SU-AI.ARPA
cc: Elyse@SU-SCORE.ARPA, Hall@SU-AI.ARPA
Marlie has given me the names of
Leslie M. Goldschlager (Ullman)
Steven Leon (Golub)
Matthew Ginsberg (McCarthy)
Cheng San Wu (McCarthy)
as visiting scholars in CSD. I plan to send them invitations to the
Forum Annual Meeting. Are they still here? Are they Dr. or Prof.?
Carolyn
-------
Wu is Prof. and Ginsberg is Dr., and I have another Guo Weide from
Peking. He isn't Dr.
∂10-Jan-84 1139 CLT How to get a dd overhauled?
To: bosack@SU-SCORE, JMC@SU-AI
The terminal nearest the door in 362MJX (my office mates)
is very hard to use due to barely legible display.
I asked Don Coates if he could fix it and he said he could
but `they' wouldn't let him order the necessary parts.
Said `I should speak to his bosses', but when I asked
who precisely, he just said that was for me to find out.
I don't know what is going on, but it seems to me that
one should be able to get a terminal with a legible display.
Any suggestions?
∂10-Jan-84 1140 PJB@S1-A Printing of File
Received: from S1-A by SU-AI with TCP/SMTP; 10 Jan 84 11:40:32 PST
Date: 10 Jan 84 1139 PST
From: Paula Bauman <PJB@S1-A>
Subject: Printing of File
To: jmc@SU-AI
It looks good. I called Virginia McGregor and told her I would bring it
over to her. -Paula
∂10-Jan-84 1614 AAAI-OFFICE@SUMEX-AIM.ARPA next pres msg
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 10 Jan 84 16:14:03 PST
Date: Tue 10 Jan 84 16:18:42-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: next pres msg
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Have you had the opportunity to write the next presidential message
for the AI Magazine? We'll need it very soon.
Thanks,
Claudia
-------
I'll try to finish it this week.
∂10-Jan-84 1645 TOB
John
I submit Joe Mundy, GE, as a possible industrial professor.
I will contact him to see whether he is available.
Tom
∂10-Jan-84 1618 @SU-SCORE.ARPA:JMC@SU-AI industrial lectures
Received: from SU-SCORE by SU-AI with TCP/SMTP; 10 Jan 84 16:18:21 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Tue 10 Jan 84 16:08:08-PST
Date: 10 Jan 84 1607 PST
From: John McCarthy <JMC@SU-AI>
Subject: industrial lectures
To: faculty@SU-SCORE, su-bboards@SU-AI
The faculty has voted to continue the program next year. Please
encourage applications to teach a one quarter course. The application
should consist of a course description suitable for inclusion in
the Stanford catalog together with as much vita as the applicant
wishes considered. Payment will be 1/16 of the lecturers annual
salary with a maximum of $3,000 for a one quarter course.
∂10-Jan-84 1649 WIEDERHOLD@SUMEX-AIM.ARPA Industrial lectureship
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 10 Jan 84 16:49:19 PST
Date: Tue 10 Jan 84 16:54:03-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Industrial lectureship
To: jmc@SU-AI.ARPA
cc: pickering@SUMEX-AIM.ARPA
I suggest that Skip ellis from Parc will be an excellent candidate.
I am asking Jayne pickering to forward you a copy of the (surface mail)
message he sent to Gene and me a month ago.
Gio
-------
∂10-Jan-84 1701 DFH Washington DC?
Are you going? Could you leave me a message so I can
tell Dina Bolla if they should deliver the ticket
tomorrow morning? Thanks.
∂11-Jan-84 0926 DFH
Wash. D.C. arrangements
I made a reservation for you at the Sheraton Washington,
Connecticut & Woodley Sts., (202) 328-2000. (The Carlton
Sheraton was full). Rate is $105, and I guaranteed it with
your AX no., since your flight doesn't get in until 10 pm.
Your confirmation no. is: G194111CR. I left a message with
the hotel info. with Gregory Chudnovsky, who says he will
tell David to start trying to call you after 10:30 pm.
Dina Bolla will deliver your tickets this morning. PLEASE
NOTE THAT THE DEPARTURE TIME IS 2:15 PM.
∂11-Jan-84 1012 BH51@CMU-CS-A
Received: from CMU-CS-A by SU-AI with TCP/SMTP; 11 Jan 84 10:12:00 PST
Date: 11 Jan 84 1303 EST (Wednesday)
From: Beverly.Howell@CMU-CS-A
To: McCarthy@SU-AI
Message-Id: <11Jan84.130343.BH51@CMU-CS-A>
----- Unsent message follows -----
Date: 9 Jan 84 1101 EST (Monday)
From: Beverly.Howell@CMU-CS-A
To: John McCarthy@SU-AI
Subject: Paris Trip
CC: Raj.Reddy@CMU-CS-A
Message-Id: <09Jan84.110134.BH51@CMU-CS-A>
Raj asked me to let you know that the tickets for you and your wife were
$3,767.00 special coach fare. We deducted the price of a business class
ticket ($2,578.00) for you. That leaves you owing us $1,189.00 for your
wife. Please make the check payable to Carnegie-Mellon University and
send it to me: Beverly Howell, Robotics Institute, CMU, Pittsburgh 15213.
If there are any questions please get in touch with me or with Raj.
Bev Howell
Carolyn: Please pay this bill next time you write checks.
∂11-Jan-84 1058 JMC name
Seyrus F. Nourani
GTE Laboratories
40 Sylvan Road
Waltham, MA 02254
617 466-2882
generalized induction, forcing, non-monotonic logic
for circumscription mailing list
∂11-Jan-84 1106 ELYSE@SU-SCORE.ARPA Meeting with Gene
Received: from SU-SCORE by SU-AI with TCP/SMTP; 11 Jan 84 11:05:55 PST
Date: Wed 11 Jan 84 11:05:16-PST
From: Elyse Krupnick <ELYSE@SU-SCORE.ARPA>
Subject: Meeting with Gene
To: ullman@SU-SCORE.ARPA, feigenbaum@SU-SCORE.ARPA, mccarthy@SU-SCORE.ARPA
cc: Golub@SU-SCORE.ARPA
Stanford-Phone: (415) 497-9746
The meeting with Gene will be at 4:30 pm oFriday, Jan 13, in the Chair's conference room.
Elyse.
-------
∂11-Jan-84 1143 KJB@SRI-AI.ARPA [John McCarthy <JMC@SU-AI>: slippage ]
Received: from SRI-AI by SU-AI with TCP/SMTP; 11 Jan 84 11:43:00 PST
Date: Wed 11 Jan 84 11:39:13-PST
From: Jon Barwise <KJB@SRI-AI.ARPA>
Subject: [John McCarthy <JMC@SU-AI>: slippage ]
To: dkanerva@SRI-AI.ARPA
cc: jmc@SU-AI.ARPA
I can't remember whether I sent you word of McCarthy's series of
lectures or not. I somehow thought they were starting next week. In
any case, I have asked him to send you an annuncment for the
newsletter, after getting the folowing message.. Hope it gets to you
in time for the newseltter.
---------------
Return-Path: <JMC@SU-AI>
Received: from SU-AI.ARPA by SRI-AI.ARPA with TCP; Wed 11 Jan 84 11:22:02-PST
Date: 11 Jan 84 1119 PST
From: John McCarthy <JMC@SU-AI>
Subject: slippage
To: kjb@SRI-AI
I will slip my lectures for a week because of an announcement not getting out.
-------
∂11-Jan-84 1205 BH51@CMU-CS-A
Received: from CMU-CS-A by SU-AI with TCP/SMTP; 11 Jan 84 12:05:28 PST
Date: 11 Jan 84 1449 EST (Wednesday)
From: Beverly.Howell@CMU-CS-A
To: jmc@su-ai
CC: Beverly.Howell@CMU-CS-A
Message-Id: <11Jan84.144924.BH51@CMU-CS-A>
----- Unsent message follows -----
Date: 9 Jan 84 1101 EST (Monday)
From: Beverly.Howell@CMU-CS-A
To: John McCarthy@SU-AI
Subject: Paris Trip
CC: Raj.Reddy@CMU-CS-A
Message-Id: <09Jan84.110134.BH51@CMU-CS-A>
Raj asked me to let you know that the tickets for you and your wife were
$3,767.00 special coach fare. We deducted the price of a business class
ticket ($2,578.00) for you. That leaves you owing us $1,189.00 for your
wife. Please make the check payable to Carnegie-Mellon University and
send it to me: Beverly Howell, Robotics Institute, CMU, Pittsburgh 15213.
If there are any questions please get in touch with me or with Raj.
Bev Howell
∂11-Jan-84 1205 PACK@SU-SCORE.ARPA Meeting?
Received: from SU-SCORE by SU-AI with TCP/SMTP; 11 Jan 84 12:05:21 PST
Date: Wed 11 Jan 84 11:58:09-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Meeting?
To: jmc@SU-AI.ARPA
I have done some more work on the blocks world with circumscription.
Can we talk about it sometime soon? I'm free Thursday from 1-2:45 and
4-6 and Friday from 2:30 on.
Sadly, I cannot take your MTC class this quarter -- the course I'm
teaching meets at the same time. It isn't televised, is it?
-Leslie
-------
How about Friday at 3:30?
∂11-Jan-84 1218 @SU-SCORE.ARPA:BH51@CMU-CS-A
Received: from SU-SCORE by SU-AI with TCP/SMTP; 11 Jan 84 12:18:41 PST
Received: from CMU-CS-A by SU-SCORE.ARPA with TCP; Wed 11 Jan 84 12:04:05-PST
Date: 11 Jan 84 1445 EST (Wednesday)
From: Beverly.Howell@CMU-CS-A
To: McCarthy@su-score
CC: Beverly.Howell@CMU-CS-A
Message-Id: <11Jan84.144531.BH51@CMU-CS-A>
----- Unsent message follows -----
Date: 9 Jan 84 1101 EST (Monday)
From: Beverly.Howell@CMU-CS-A
To: John McCarthy@SU-AI
Subject: Paris Trip
CC: Raj.Reddy@CMU-CS-A
Message-Id: <09Jan84.110134.BH51@CMU-CS-A>
Raj asked me to let you know that the tickets for you and your wife were
$3,767.00 special coach fare. We deducted the price of a business class
ticket ($2,578.00) for you. That leaves you owing us $1,189.00 for your
wife. Please make the check payable to Carnegie-Mellon University and
send it to me: Beverly Howell, Robotics Institute, CMU, Pittsburgh 15213.
If there are any questions please get in touch with me or with Raj.
Bev Howell
∂11-Jan-84 1315 DKANERVA@SRI-AI.ARPA
Received: from SRI-AI by SU-AI with TCP/SMTP; 11 Jan 84 13:15:41 PST
Date: Wed 11 Jan 84 13:16:48-PST
From: DKANERVA@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
cc: kjb@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 11 Jan 84 11:40:00-PST
Thanks for getting the announcement to me. I'll get it in this
evening's Newsletter. There was no problem cleaning up the file.
-- Dianne
-------
∂11-Jan-84 1404 MA mtc qual reading list
To: JMC, ZM
I would be interested in taking the mtc qual this year. Could you please
think about the reading list? See you soon.
Martin
∂12-Jan-84 1810 ULLMAN@SU-SCORE.ARPA list management
Received: from SU-SCORE by SU-AI with TCP/SMTP; 12 Jan 84 18:10:06 PST
Date: Thu 12 Jan 84 18:08:15-PST
From: Jeffrey D. Ullman <ULLMAN@SU-SCORE.ARPA>
Subject: list management
To: CS440: ;
I am probably letting myself in for a peck of trouble, but it occurred
that we have an easy mechanism for getting on the CS440 list, but
no way to get off it. Is there anyone who would like their name
removed?
-------
∂12-Jan-84 2146 PACK@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 12 Jan 84 21:46:16 PST
Date: Thu 12 Jan 84 21:47:07-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 12 Jan 84 21:40:00-PST
That's fine.
-------
∂12-Jan-84 2338 ULLMAN@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 12 Jan 84 23:38:06 PST
Date: Thu 12 Jan 84 23:38:58-PST
From: Jeffrey D. Ullman <ULLMAN@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 12 Jan 84 21:42:00-PST
You're not on it.
You're probably on the "super" list; surely you don't want to be off that!
-------
∂13-Jan-84 1523 @SU-SCORE.ARPA:DELAGI@SUMEX-AIM.ARPA [Penny Nii <NII@SUMEX-AIM.ARPA>: Monday Adv Arch mtg]
Received: from SU-SCORE by SU-AI with TCP/SMTP; 13 Jan 84 15:23:01 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Fri 13 Jan 84 15:14:53-PST
Date: Fri 13 Jan 84 15:20:02-PST
From: Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>
Subject: [Penny Nii <NII@SUMEX-AIM.ARPA>: Monday Adv Arch mtg]
To: super@SU-SCORE.ARPA
fyi
---------------
Mail-From: NII created at 13-Jan-84 13:57:44
Date: Fri 13 Jan 84 13:57:43-PST
From: Penny Nii <NII@SUMEX-AIM.ARPA>
Subject: Monday Adv Arch mtg
To: Adv.Architectures: ;
We have some visitors from the East to talk about the latest on the Connection
Machine. The visitors are Phil Agre, Dave Christman, Glen Kramer (spel?).
They have a prepared talk but are willing to answer any questions.
This meeting will be held in MJH 352, on Monday at noon.
penny
-------
-------
∂13-Jan-84 1525 DFH Security form
Personnel says they instructed the mail room to send it
registered and "overnight". They are unable to tell me
at this point if it was sent here or to your home. They
will try to call back with the registered no. later today,
but they might not get back to us today either. Also,
they will be closed on Monday.
∂13-Jan-84 1630 BSCOTT@SU-SCORE.ARPA ARPA Update
Received: from SU-SCORE by SU-AI with TCP/SMTP; 13 Jan 84 16:30:30 PST
Date: Fri 13 Jan 84 16:29:36-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: ARPA Update
To: JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, DCL@SU-AI.ARPA, ZM@SU-AI.ARPA,
Wiederhold@SUMEX-AIM.ARPA
cc: DFH@SU-AI.ARPA, MAS@SU-AI.ARPA, RBA@SU-AI.ARPA, Atkinson@SU-SCORE.ARPA
In response to a message to John Machado, asking whether the current contract
was going to be extended -- for sure -- past 1/31, he called me. The latest
word is that it is indeed going to be extended for some period of time, and
a modification will be issued for a fairly "substantial" funding increment.
I am sorry to be vague, but he would not give me any details. So, we just
have to take his telephoned word, and wait for the paperwork.
I think a substantial funding increment means further delays in the umbrella
contract, but I will let you know as soon as I have any additional informa-
tion.
Betty
-------
∂13-Jan-84 1828 ULLMAN@SU-SCORE.ARPA Re: lists
Received: from SU-SCORE by SU-AI with TCP/SMTP; 13 Jan 84 18:28:50 PST
Date: Fri 13 Jan 84 18:28:23-PST
From: Jeffrey D. Ullman <ULLMAN@SU-SCORE.ARPA>
Subject: Re: lists
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Fri 13 Jan 84 15:49:00-PST
You are on the super list as jmc@sail; you are not on the other list,
but super is.
I'll change your name on super to jmc-lists
-------
∂14-Jan-84 1127 BSCOTT@SU-SCORE.ARPA Diana's Office
Received: from SU-SCORE by SU-AI with TCP/SMTP; 14 Jan 84 11:27:14 PST
Date: Sat 14 Jan 84 11:28:09-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Diana's Office
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, I closed Diana's office door. We have an order in to bolt the typewriters
to the desks, but this has not yet been done, and I was concerned that the new
one might disappear.
Betty
-------
∂15-Jan-84 0126 ME passwords
∂15-Jan-84 0059 JMC password
Is there some way I can make my auxiliary areas impossible to log in on, i.e.
with no usable password. I alway log in on 1,jmc and alias to the other
areas.
ME - No, all you can do is set a random password that can't be guessed.
We could, however, define the last free bit in the directory protection
to mean login is not permitted on that directory. I haven't considered
that an important feature to have.
∂15-Jan-84 2100 JMC*
post office about reg. mail
∂16-Jan-84 0059 ME
You should send your bboard comments on linear data base and editor searching
to other-su-bboards.
∂16-Jan-84 0900 JMC*
postoffice about reg.
∂16-Jan-84 0903 GOTELLI@SU-SCORE.ARPA Lutz Erbring
Received: from SU-SCORE by SU-AI with TCP/SMTP; 16 Jan 84 09:03:22 PST
Date: Mon 16 Jan 84 09:04:03-PST
From: Lynn Gotelli <GOTELLI@SU-SCORE.ARPA>
Subject: Lutz Erbring
To: JMC@SU-AI.ARPA
cc: gotelli@SU-SCORE.ARPA
John, Lutz Erbring has requested a Sail computer account. He
mentioned your name to me as working with him. His request
seems legimate. Are you willing to pay for his Sail account
or should he pay for it himself?
Thank you,
Lynn
-------
As Erbring and I agreed, he will pay for it himself.
∂16-Jan-84 0909 DFH Livermore package
I need more information from Livermore if I'm
going to find anything out from the P.O., and
from what I was told Friday, they are closed
today. Did they give you a registered number or
express number or even say which way they sent it?
The P.O. says it couldn't be both. They also said
if they tried to deliver to your home & nobody was
there they would have left a claim check.
Sorry Livermore gave me no number. They told me it was registered,
but a search turned up no claim check. I guess we wait till tomorrow.
∂16-Jan-84 0917 HST lisp history
hi john.i met steve russell friday.he really got grey hairs.and he still
is a member of the mit tech railroad club.he remembered not veryy much
but convinced me that he started the first interpreter - an apply-
function only - in december 58.i already di know that this should have
existed.the program really seems to be lost.(the first version of your
"recursive functions..." pa\zper.)the he remembered that this apply was
completed in late january.he claimed that it was'nt the substitution apply
which is des cribed in memo8 of febraur 58.(59 of course)
the apply-eval of may(did i tell you that joel moses has saved a program
listin ng?)59 was according to him the second version(he was not quite
correct to date it).he remembered that garbage collectionm was proposed
very early after considerable study of alternatives.he was not sure if it
was new then.
new for me was that you already hadeady had ordered to do work at
Dartmouth because he was student in mathematics there (he didn't remember
that he did anything at all that time for you but learned to program the
704.)you see-that's not very much.the paper which i was searching for he
was pretty shure to have never written it.
the basic question is now,where may be a record of this first apply function?
that's all.i thank you very much for the kind treatment.bye.
∂16-Jan-84 0945 DFH SAIL Accts./CS258
I spoke with Stuart about this. He needs you to
send him a message stating exactly what facilities
that are unique to SAIL that the CS258 students need
to use (he is Reges@score). Then he will notify Lynn
and we will arrange to set up the accounts. He would
also like your estimate of the computer charges for
the class. Even those students who already have SAIL
accounts will have to get another one just for CS258
use, as there is no practical way of breaking down
the charges on their existing accounts. There is
money available, and there should be no problem with
getting the accounts.
The SAIL accounts for CS258 are needed because of the character
set used for the EKL interactive theorem prover and the integration
of EKL with the editor. The use of EKL on LOTS last quarter was
rather unsatisfactory. The students will also use the Boyer-Moore
theorem prover (Maclisp version) which is being supported on SAIL
only at present. There are about 12 students and I'll guess $150
apiece.
∂16-Jan-84 1211 REGES@SU-SCORE.ARPA Computer Accounts for CS 258
Received: from SU-SCORE by SU-AI with TCP/SMTP; 16 Jan 84 12:11:39 PST
Date: Mon 16 Jan 84 12:12:06-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Computer Accounts for CS 258
To: gotelli@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, bscott@SU-SCORE.ARPA, dfh@SU-AI.ARPA
Office: Margaret Jacks 210, 497-9798
John has convinced me that his 258 class will require resources unique to
SAIL. Therefore, it is appropriate to set up special accounts for the students
in that class and charge their use to 1-FCZ050. John believe the students will
use something like $150 for the course. Naturally, we can't limit that on SAIL,
but if you see anyone who is way out of line you might warn John and/or myself.
Dianna will provide you with a list of names of students in the class. I
suggest doing the normal thing, setting up accounts names like CS258-FOOBAR,
where FOOBAR is the person's last name.
John, please let your students know that they should use these special accounts
for their classwork even if they have SAIL accounts already.
-------
Thanks Stuart; Diana spells her name with one n.
∂16-Jan-84 1238 CLAUER@SU-SIERRA.ARPA re: Simple database system? (from SAIL's BBOARD)
Received: from SU-SIERRA by SU-AI with TCP/SMTP; 16 Jan 84 12:38:35 PST
Date: Mon 16 Jan 84 12:39:30-PST
From: C. Robert Clauer <CLAUER@SU-SIERRA.ARPA>
Subject: re: Simple database system? (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Mon 16 Jan 84 09:08:00-PST
-Such a system for a simple database as described by John McCarthy is used
on the STAR-VAX and uses the VMS SEARCH command to locate information. A
couple of Command Procedures have been written to enter and retrieve information
from the database and it is possible to have several files, eg: addresses,
phone messages, program notes, etc. This system is used by several members of
the Space Plasma Physics group and it has been found to be quite handy.
CRC@SU-STAR
-------
∂16-Jan-84 1256 Solomon.Datanet@MIT-MULTICS.ARPA visit
Received: from MIT-MULTICS by SU-AI with TCP/SMTP; 16 Jan 84 12:55:54 PST
Acknowledge-To: Solomon@MIT-MULTICS.ARPA
Date: Monday, 16 January 1984 15:54 est
From: Solomon@MIT-MULTICS.ARPA (Richard Jay Solomon)
Subject: visit
To: jmc@SU-AI.ARPA
Message-ID: <840116205412.806664@MIT-MULTICS.ARPA>
I will be in San Francisco week of Feb 6th for a conference. Would like
to drop by for a short visit at Stanford. When is a good time, if
anytime is good. Should have a condensed version of our edited tapes
with me by then.
Richard Solomon
413 267 5171 or 617 253-5159
I'll be in town that week but won't have a lot of time. Late some
afternoon except for Friday would be ok. Why don't you call when
you get in town. (office: 497-4430) (home: 857-0672). Herbert Stoyan
was rooting around in my old files and found two more early M.I.T.
memos concerning time-sharing.
∂16-Jan-84 1324 CLT Calendar events
Thu. 26 Jan 20:00 SFBallet Opera House
Sun. 18 Mar 20:00 SFBallet Cinderella
∂16-Jan-84 1419 KJB@SRI-AI.ARPA Dretske's talks
Received: from SRI-AI by SU-AI with TCP/SMTP; 16 Jan 84 14:19:09 PST
Date: Mon 16 Jan 84 14:17:58-PST
From: Jon Barwise <KJB@SRI-AI.ARPA>
Subject: Dretske's talks
To: csli-d1@SRI-AI.ARPA, csli-d2@SRI-AI.ARPA, csli-d3@SRI-AI.ARPA,
csli-d4@SRI-AI.ARPA
[There ought to be an easier way to send things to area D folks.]
Fred Dretske is giving the CSLI colloquium Thursday and the Phil Dept
Colloquium Friday. If Fred is interested, we will go out to dinner as
a group Thursday. Friday evening Mary Ellen and I will host a party
after the phil. dept colloquium.
I think that Dretske is the philosopher most influential in bringing
informaiton, and its importance to language and cognition, to the
fore. He has certainly had a big influence on me. I think you will
find him an interesting and stimulating speaker.
Jon
-------
∂16-Jan-84 1547 CL.BOYER@UTEXAS-20.ARPA Re: manual
Received: from UTEXAS-20 by SU-AI with TCP/SMTP; 16 Jan 84 15:46:48 PST
Date: Mon 16 Jan 84 17:48:33-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Re: manual
To: JMC@SU-AI.ARPA
cc: cl.moore@UTEXAS-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Mon 16 Jan 84 12:27:00-CST
The book still provides a lot insight into how the system
"works", but it in no way offers the kind of information one
wants in a user's manual. The old SRI manual is very
inaccurate now. The best that we can offer at the moment is
the file CODE.DOC, of which Carolyn has a copy. It's only
merit is its brevity. Any statement from you about what
kind of information you would like the students to have
would undoubtedly influence what we write.
-------
Boyer says that "the best we can offer at the moment is the
file CODE.DOC, of which Carolyn has a copy".
∂16-Jan-84 1606 JK
In order to make definition by induction a theorem, one
needs the axiom: If for all x there is a unique y such that P(x,y)
then there is a f such that ∀x.P(x,f(x))
∂16-Jan-84 1809 REM@MIT-MC output-directed debugging/verification of software
Received: from MIT-MC by SU-AI with TCP/SMTP; 16 Jan 84 18:09:16 PST
Date: 16 January 1984 21:10 EST
From: Robert Elton Maas <REM @ MIT-MC>
Subject: output-directed debugging/verification of software
To: JMC @ SU-AI
I'm in the process of developing a system for aiding debugging of
software by tracing errors in output back to their causes. (Sussman
apparently did something similar in the 70's although I didn't find
out about it until I had independently thought of it and for years
been advocating the approach to people who ask what is next for
programmer environments after windows&mice.)
In the process of describing my idea, I often paraphrase something you
once said to the effect that the only reall important thing about a
program is the output it produces, which is right or wrong
independently of how "pretty" the program is etc. Could you supply me
with a reference and exact quote so I can do you justice in my
documentation/report?
I can't think of a reference, and I don't suppose I said precisely that.
In my theoretical work I emphasized what is sometimes called extensional
properties of programs, i.e. the input-output relation.
∂16-Jan-84 1939 JK
One way to handle programs and partial functions:
Describe programs as input-output relations.
Have the following general axiom:
For any relation R there is a function selector(R) such that
for any x:
∃y.R(x,y) →→ R(x,(selector(R))(x)))
∂17-Jan-84 0931 DFH Livermore package
Did this final show up at your home yesterday?
If not, I'll see what else I can find out.
∂17-Jan-84 1025 DFH More Livermore package
Lynn called. If you have not received the item
by noon today they want to have someone drive
over with it, so they would get here about 1-1:30.
Please let me know if you get the package, and if not
if 1 pm or so is OK for them to come, or if it should
be later in the afternoon.
∂17-Jan-84 1312 AAAI-OFFICE@SUMEX-AIM.ARPA aaai-84 conference brochure
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 17 Jan 84 13:11:34 PST
Date: Tue 17 Jan 84 13:16:20-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: aaai-84 conference brochure
To: JMC@SU-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Here is a draft of the AAAI-84 conference brochure. If you have
the time and inclination, could you pls review the draft?
Thanks,
Claudia
CONTENTS
INTRODUCTION ......................................
NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE .....
Technical Program .........................
Tutorial Program ..........................
R&D Exhibit Program .......................
Social Occasions ..........................
Conference Registration ...................
HOUSING ACCOMMODATIONS .............................
TRANSPORTATION .....................................
Conference Registration Form
University of Texas Housing Form
Austin Central Housing Bureau Form
AAAI Membership Application Form
AAAI-84, the National Conference on Artificial Intelligence,
is being sponsored by the American Association for Artificial
Intelligence (AAAI) and co-sponsored by the University of Texas,
Austin, Texas. AAAI is the scientific society for the
Artificial Intelligence community in the United States. It
sponsors or co-sponsors annual AI conferences in this country and
abroad and produces the only magazine devoted to the field of
artificial intelligence, the AI Magazine.
Founded in 1979, the Association consists of approximately 4,000
members from academia, industry, commerce and government.
Membership in the AAAI is open to anyone with an interest
in Artificial Intelligence research and development. Benefits of membership
include:
* Affiliation with the principal association in the
field of Artificial Intelligence;
* A direct link to the U.S. Artificial Intelligence community;
* A reduced conference registration fee for AAAI conferences;
* Subscription to the official AAAI publication, the AI Magazine;
* Early announcements of AAAI-sponsored activities; and
* A reduced subscription rate to the Artificial Intelligence
Journal (published by Elsevier-North Holland).
A membership form is located in the back of this brochure.
THE AAAI ORGANIZATION
President: John McCarthy, Stanford University
President-elect: Woodrow Bledsoe, University of Texas
Past Presidents: Marvin Minsky,Massachusetts Institute of Technology;
Edward Feigenbaum, Stanford University; Allen Newell, Carnegie-Mellon
University; Nils Nilsson, SRI International
Secretary-Treasurer: Richard Fikes, IntelliGenetics Inc.
Executive Director: Claudia Mazzetti
COUNCILORS
Saul Amarel, Rutgers University; Eugene Charniak, Brown University;
Randall Davis, Massachusetts Institute of Technology;
Michael Genesereth, Stanford University; Barbara
Grosz, SRI International; Peter Hart, Syntelligence Corp.; Raj Reddy,
Carnegie-Mellon University; Charles J. Rieger III, Scion, Inc.;
Stanley Rosenschein, SRI International; Mark Stefik, Xerox
Palo Alto Research Center; Gerald Sussman, Massachusetts Institute of
Technology; Bonnie Lynn Webber, University of Pennsylvania
AI MAGAZINE
Editor-in-Chief: Robert Engelmore, Teknowledge, Inc.
Managing Editor: Claudia Mazzetti
Associate Editors: Madeline Bates, Bolt, Beranek &
Newman; Jaime G. Carbonell, Carnegie-Mellon University (Techniques &
Methodology); Michael Fehling, Advanced Information & Decision Systems
(Book Reviews); Jonathan King, Symantec (Research in Progress);
Brian McCune, Advanced Information & Decision Systems; John McDermott,
Carnegie-Mellon University; Stephen Slade, Yale University; Derek
Sleeman, Stanford University (Techniques & Methodology).
STANDING COMMITTEES
Conference: Jay M. Tenenbaum, Fairchild Laboratory of AI Research
Finance: Raj Reddy, Carnegie-Mellon University; Don Walker, SRI International
Membership: Bruce Buchanan, Stanford University
Publications: Lee Erman, Teknowledge, Inc.
AAAI-84 CONFERENCE OFFICIALS
Program Chairman: Ronald Brachman, Fairchild Laboratory of AI Research
Tutorial Chairman: Douglas Lenat, Stanford University
Conference Director: Claudia Mazzetti
Local Arrangements Chairman: Elaine Rich, University of Texas
Local Arrangements Committee: Gordon Novak, University of Texas;
Barbara Smith, University of Texas; David Touretzky, Carnegie-Mellon
University
NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE
AAAI-84 is the fourth national conference sponsored by the American
Association for Artificial Intelligence. The purpose of the National
Conference is to promote research in the field of Artificial
Intelligence by bringing together individuals from government,
commerce and academia and by providing a published record of the
National Conference as proceedings.
The three main parts of AAAI-84 are the Technical Program, the
Tutorial Program and the Research & Development (R&D) Exhibit Program.
Because this year's facilities are smaller, registration for the
technical and tutorial programs will be limited. Please register
early.
THE TECHNICAL PROGRAM
August 7 to 10, 1984
The Technical Program is the main annual forum for researchers to send
previously unreported results to an extensive technical audience. The
program will feature substantial, original research in subfields of
Artificial Intelligence (representative topics are noted below). All
papers will be refereed by a Program Committee of prominent
researchers in the field, and acceptance for presentation at the
conference will be based on the originality and significance of the
reported research as well as the quality of the exposition of the
ideas. In the past, AAAI conference proceedings have provided a
high-quality record of current research in Artificial Intelligence.
In order to encourage outstanding technical contributors, a Publisher's
Prize of $1,000, donated by the MIT Press, will be awarded to the best
paper. Submitted papers that present significant research accomplishments,
and are considered to be paragons of clear writing, will be nominated for
the Prize. The Program Committee will then select the best paper from
the publication versions of those nominated. The prize-winning paper,
with other nominees considered of comparable quality, will be featured at
a special session of the conference.
AAAI-84 encourages theoretical contributions in any of the topics
noted below. The Program Committee will also consider papers that
clearly demonstrate the power of accomplished techniques. Thoughtful
and convincing critiques will be considered appropriate if it fosters
good scientific research in AI.
!
CONFERENCE TOPICS
AI and Education (including Intelligent CAI)
AI Architectures and Languages
Automated Reasoning (including automatic programming,
automatic theorem-proving, commonsense reasoning, planning,
problem solving, qualitative reasoning, search)
Cognitive Modelling
Expert Systems
Knowledge Representation
Learning
Methodology (including technology transfer)
Natural Language (including generation, understanding)
Perception (including speech, vision)
Philosophical and Scientific Foundations
Robotics
We plan to vary the structure of this year's technical conference.
With this new format we hope to avoid typical conflicts among
competing sessions and allow researchers to interact more intensively
in their areas of specialization.
Tuesday, August 7, and Wednesday, August 8 will feature accepted papers
in the technical subfields of AI. We plan to have a small number of
parallel sessions (nominally 3) during these two days, with very little
overlap in interest among the parallel sessions. These specialized sessions
may also feature panel discussions and invited speakers, where the topic
of discussion is fairly narrow.
On Thursday, August 9, and Friday, August 10, attention to the topics
of more general interest to the AI community will be
presented. Those days will feature plenary sessions which will include
the President's Address, presentations of papers nominated for the
Publisher's Prize and accepted papers of general interest, and invited
talks and discussions on broad topics ( i.e. logic programming,
computer learning).
[ sections on tutorial descriptions ]
AAAI-84 RESEARCH & DEVELOPMENT (R&D) EXHIBIT PROGRAM
August 6 to 10, 1984
An important service provided by the AAAI to the conference attendees
is the week-long R&D Exhibit Program. In a dedicated exhibit area in
the Performing Arts Center, hardware and software manufacturers will
display and demonstrate products and/or services relevant to the AI
community. As in the past, university and industrial laboratories
have been invited to participate in the R&D Exhibit Program. Leading
publishers will take the opportunity to display a variety of titles in
Artificial Intelligence, computer science, cognitive science,
linguistics, and other related disciplines. Previous participants in
AAAI exhibit programs have included:
Machine Intelligence Corporation, The LISP Company,
Addison-Wesley Company, SRI International, Inference
Corporation, Stanford University, MIT Press,
Digital Equipment Corporation, Symbolics, Lisp Machines,
Elsevier-North Holland, William Kaufmann Inc., IntelliGenetics
Inc., Teknowledge Inc., Xerox, Cognitive Systems, Inc., John
Wiley & Sons, General Electric !
SOCIAL OCCASIONS
Hospitality
-----------
Tuesday, August 7, 1984
Informal Reception in the Performing Arts Center
6:00 to 7:00 p.m.
Complimentary wine, beer, punch and dry hors d'oeuvres
Following the reception, buses will provide transportation to Austin's
Sixth Street, a newly renovated downtown area with a variety of restaurants
and night spots.
Wednesday, August 8, 1984
Main Conference Reception (open to all conference attendees)
6:00 to 7:00 p.m.
Complimentary wine, beer, punch and hot and cold hors d'oeuvres
There will be a cash bar.
Thursday, August 9, 1984
Gala Reception at Fiesta Gardens
7:00 to 10:00 p.m.
Friday, August 10, 1984
Hail and Farewell in the Performing Arts Center
5:00 to 6:00 p.m.
Complimentary beer, wine and dry hor d'oeuvres
******************************************************
Gala Reception at Fiesta Gardens
Thursday, August 9, 1984
7:00 to 10:00 p.m.
Fiesta Gardens is a beautiful park located at Town Lake. It is a
perfect site for a "Tex-Mex" evening. Decorated booths will offer
a wide variety of food. Fresh tortillas (including whole wheat)
will be made as you watch. Other booth will offer other foods, including
fajitas, a Texas speciality of marinated grilled beef. Still other booths
will offer pitchers of Margaritas and Sangria. A mariachi band will
provide entertainment. Round trip transportation to Fiesta Gardens from
Performing Arts Center and Jester Center will be provided. Two free
drink tickets are included in the banquet price of $18.00.
The Reception Menu
------------------
Torilla chips
Guacamole
Picante Sause
Chile conquesto
Ceviche (marinated spicy fish)
Nacho supreme ( a layered casserole of chile, cheese, guacamole and olives,
served with petite chalupa shells )
Fresh torillas
Fajitas (grilled, marinated beef)
Spicy chicken kabobs, grilled on site with a tangy sauce
Assorted condiments including cheese,lettuce, tomatoes, olives, nuts and
raisins
Fresh fruit cascade, served with a Mexican chocolate fondue
Margaritas
White wine sangria
Beer
Fruit punch
!
CONFERENCE REGISTRATION
Technical Conference Registration
August 7 to 10, 1984
Benefits associated with the Technical Conference Registration fee are:
* Admission to all technical presentations of the conference;
* a copy of the AAAI-84 conference proceedings;
* a conference registration packet (including portfolio);
* admission to the R&D Exhibit program; and
* admission to all conference social hours, excluding the
Fiesta Social , Thursday, August 9, 1984.
REGISTRATION FEE SCHEDULE
Regular Student
Early Registration (postmarked before June 18)
AAAI Members $100 $60
Non-Members $140 $85
Late Registration (postmarked before July 18)
AAAI Members $130 $85
Non-Members $165 $105
(If you are not a member of the AAAI and wish to qualify for the AAAI member
conference registration rate, you may do so by becoming a AAAI member.
Complete the membership application form at the back of this brochure and
send it and conference registration form together).
Tutorial Program
August 6 and 7, 1984
Benefits associated with the Tutorial Registration fee are:
* Attendance to the tutorial(s);
* a copy(s) of the tutorial syllabus(es);
* a conference registration packet (including portfolio);
* admission to the R&D Exhibit Program; and
* admission to all conference social hours,
excluding the Fiesta Social, Thursday, August 9, 1984.
TUTORIAL FEE SCHEDULE
(applicable for all tutorials)
Early Registration (postmarked before June 18)
Regular $175
Student $ 75
Late Registration (postmarked before July 18)
Regular $200
Student $100
PLEASE REMEMBER SPACE IS LIMITED FOR THE TUTORIALS AND TECHNICAL PROGRAMS.
REGISTER EARLY!
*************************************************************************
PLEASE NOTE:* NO REQUEST FOR REFUNDS WILL BE ACCEPTED AFTER JULY 23, 1984.
* ONLY GOVERNMENT PURCHASE ORDERS WILL BE ACCEPTED.
* WE WILL NOT ACCEPT ANY REGISTRATION FORM POSTMARKED AFTER
JULY 23, 1984. IF WE RECEIVE IT AFTER THAT DATE, IT WILL
BE RETURNED TO YOU BY MAIL.
* IF SPACE IS AVAILABLE FOR THE TUTORIALS AND/OR
TECHNICAL PROGRAMS, REGISTRATION FOR THE
THOSE PARTS OF THE CONFERENCE WILL BEGIN SUNDAY, AUGUST 5, 1984
FROM 3:00 to 5:00 p.m. in the Performing Arts Center's Lobby.
* WE DO NOT ACCEPT CREDIT CARDS OR FOREIGN CURRENCY.
**************************************************************************
************************* **************************************************
* CONFERENCE INQUIRIES: * * IMPORTANT DATES TO REMEMBER:
* Paper Deadline April 2
* AAAI * * Early Conference Registration deadline June 18
* 445 Burgess Drive * * Late Conference Registration deadline July 18
* Menlo Park, CA 94025 * * Conference Refund (written request,NO PHONE
* (415) 328-3123 * * CALLS) deadline July 23
************************* *************************************************
*****************************************
* MESSAGE CENTERS *
* Performing Arts Center(Conference *
* site (512) 471-4511 *
* Jester Center West Desk *
* (512) 471-3944 *
*****************************************
*********************************************************************
* Program Inquires: Tutorial Inquiries:
* Ronald Brachman, Douglas Lenat, Tutorial Chair
* Program Chair Dept. of Computer Science
* Fairchild Laboratory for Stanford University
* AI Research Stanford, CA 94305
* 4001 Miranda, MS 30-888 Lenat@SCORE
* Palo Alto, CA 94304
* Brachman@SRI-KL
***********************************************************************
TUTORIAL NO. 1: AN OVERVIEW OF ARTIFICIAL INTELLIGENCE
Monday, August 6, 1984
9:00 a.m. to 1:00 p.m.
PREFACE
The field of AI is exploding, along with the demand for people who can
practice and manage it. The reason is clear: AI technology is needed
to cut the cost of writing and maintaining programs, to build smart
robots, to automate offices, to create expert systems for engineering,
medical, artistic, and business applications, to diagnose and even
design hardware and in general to cope with complexity.
CONTENT
While the literature on AI is vast and growing, it is still possible
to understand the fundamentals in a few hours. Attendees at this
tutorial will learn how AI programs work, and why, and will develop a
feel for what can be done easily, what may be done with effort and
what cannot be done without breakthroughs in research.
SPECIFICS
This tutorial will examine:
(1) Introduction: What is Artificial Intelligence?
Examples of AI programs. A brief history of AI.
(2) Problem Solving by Search: How are various problems
cast as searches? What types of information can be brought to
bear on a problem, when the search for a solution threatens to be
interminable? How are these various types of
knowledge represented in, and used by, computer programs?
(3) Understanding: What are the problems that arise (and
solutions that have been found) in getting programs to
understand speech, visual images, and prose (see related tutorial 3)
(4) Learning and teaching: Getting programs to automatically acquire
new knowledge, by being told, by observing, by analogy,
and by proposing and carrying out experiments.
Getting programs to teach their knowledge to humans (see
related tutorial 2).
(5) AI Programming: Special purpose languages (such as LISP and
Prolog) and machines suited to the development of AI programs
(see related tutorials 6 and 7).
(6) Dealing with difficulties (such as conflicting goals and uncertain
knowledge) and opportunities (such as parallel processing).
Achieving expert-level performance (see related tutorials 4 and 5).
(7) Synthesis: Speculations on the nature of
intelligence; why AI methods "work"; a timetable of future
achievements and failures of AI, with specific attention to the
recent trend toward industrializing AI.
INTENDED AUDIENCE
This tutorial is intended for engineers, scientists, and technical
managers interested in learning about AI. It will be particularly
useful for those who may become involved in an AI effort at
their own company, because the lecturers will detail the
limitations and common problems with transferring AI technology
to industry. It presumes no previous experience with
Artificial Intelligence, and serves as a good foundation for
most of the following tutorials.
LECTURERS
Dr. Douglas B. Lenat received his Ph.D. from Stanford in 1976. His thesis,
AM, was an application of the expert systems paradigm to the open-ended
task of theory formation in mathematics. Lenat received the biannual
Computers & Thought Award by the International Joint Committee on
Artificial Intelligence, for this work, in 1977. He is now an assistant
professor of computer science at Stanford University, and has built
expert systems which learn by discovery in such fields as ship design,
programming, and VLSI design. Lenat has given tutorials on expert
systems for Teknowledge, Inc., WICS, at the 1981 NCC, and also at the
first AAAI conference (1980), and again at NCC in 1981. In 1982, he
was awarded the Publisher's Prize for the best paper at AAAI-82 National
Conference, for his paper presenting a synthesis of ideas on the nature
of heuristic reasoning. Lenat is on the editorial board of the Journal
of Automated Reasoning, and of the Pitman Research Notes in AI. In
1983, he was invited to give the keynote address on Machine Learning at
IJCAI, and one of the two invited talks at AAAI. Besides his Stanford
affiliation, he currently consults for Thinking Machines Corporation and
Teknowledge. Lenat has authored chapters in several books, including
the recently-issued@i Building Expert Systems, of which he is co-editor.
Dr. Marvin Minsky is MIT's Donner Professor of Science since 1974.
Between 1968 and 1973, he was the director of MIT's Artificial
Intelligence Laboratory, which he co-founded with John McCarthy in
1958. Dr. Minsky received his Ph.d in Mathematics from Princeton in
1954, after receiving his A.B in Mathematics from Harvard. In 1956,
Drs. Minsky and McCarthy and others participated in the Dartmouth
Summer Research Project on Artificial Intelligence - one of the first
opportunities to discuss the possibility of simulating learning and
other features of intelligence with the use of machines.
In 1951, Dr. Minsky and Dean Edmonds built one of the first electronic
learning machines. Later in 1956, he became interested in using computers
to prove euclidean theorems. In 1957, he became a staff member at MIT's
Lincoln Lab where he worked on pattern recognition. In 1958, he
moved into MIT's Mathematics Department and started the AI group.
In 1963, working with Seymour Papert, they initiated research programs
in human perception, child psychology, experimental robots and the
theory of computation. In 1969, they wrote @i Perceptrons as an attempt
to reveal the inadequacies of the Perceptron project.
Under Minsky's guidance, early research programs, such as James Slagle's
SAINT program and Daniel Bobrow's STUDENT program, emerged. In the mid-
1960s, Minsky and Papert developed the "Society of the Minds" theory
which suggests intelligence emerges from the interaction of many small
systems operating within an evolving administrative structure.
Recently, Minsky has studied the use of robots in space and on earth to
the development of the human mind and its ability to deal with
paradoxes.
Dr. Minsky is a former President of the American Association for
Artificial Intelligence and recently the co-founder of Thinking Machines
Corp.
!
TUTORIAL NO. 2: APPLICATIONS OF AI TO TRAINING AND EDUCATION
Monday, August 6
2:00 to 6:00 p.m.
PREFACE:
Advances in hardware, expert systems, and machine learning, coupled
with recent theories of cognition, make possible new kinds of learning
and training environments -- environments that use intelligent,
computer-based coaches to maximize the benefits of learning-by-doing.
These new environments incorporate explicit models of subject matter
expertise, theories of how material is learned or mislearned,
notions of how procedural skills are mastered with "understanding"
rather than just rotely performed. Recent research on mental models
suggests that "cognitive fidelity" in training simulators is as
important as physical fidelity, thus opening up the possibility for
teaching generic understanding of complex systems. The examples
provided by these environments change our conceptualization of what an
intelligent job performance aid can do, as well as setting strong
requirements for the design of expert systems.
CONTENT:
This tutorial will survey the state of the art in the use of AI for
instruction. Special emphasis will be placed on detailed examples of
how to build computer-based coaches, how to build diagnostic systems
capable of inducing a user's understanding and misunderstandings of the
domain and how to tailor explanation to the user rather than the
machine. Methods for exploiting the new generation of personal AI
machines for tutoring will be discussed.
SPECIFICS
The tutorial will examine:
(1) Knowledge representation techniques appropriate for education.
(2) Construction and use of student models.
(3) The nature of student misconceptions.
(4) Qualitative and analogical reasoning.
(5) The interaction between explanation and the structure of knowledge in
expert systems.
(6) Using computer-based coaches with games to increase educational
effectiveness.
(7) Using intelligent tutoring techniques to provide novel man-machine
interfaces.
INTENDED AUDIENCE
This tutorial is intended for professionals wanting to understand the
impact AI will have on training and education, those wanting to
construct a new generation of man-machine interfaces, and those
interested in building self-explaining, intelligent systems.!
LECTURERS
Dr. John Seeley Brown is a Principal Scientist in the Cognitive Instructional
Sciences group at the Xerox Palo Alto Research Center(PARC). Before coming
to Xerox PARC, he was a Senior Scientist at Bolt, Bernack & Newman (1973-1978)
and held joint appointments in the Departments of Information and Computer
Science and Psychology at the University of California, Irvine
as an assistant professor (1969-1973). He received his Ph.d in Computer
and Communication Sciences from the University of Michigan in 1972,
after receiving a M.S. (Mathematics) from the University of Michigan
and a B.A. (Mathematics & Physics) from Brown University.
At the University of Michigan, Dr. Brown was engaged in building
computer simulation models of perception and hypothesis formation.
After joining the faculty at the University of California at Irvine,
his research was directed toward creating pragmatic techniques
for inference making, question-answering and natural language
comprehension. As a consultant to System Development Corporation, he
was co-principal investigator for the natural language CAI project.
At Bolt, Beranek and Newman, Dr. Brown headed up the Intelligent Computer
Assisted Instruction (ICAI) group, which explored ways to combine
cognitive theories and AI techniques to construct new kinds of learning
environments that capitalized on experiental learning. He also helped
with the development of SOPHIE, an intelligent teaching
system for electronic troubleshooting.
At Xerox, Dr. Brown started a new, basic research group in Cognitive and
Instructional Sciences which is primarily concerned with understanding
how people understand and construct mental models of complex systems.
As a principal contributor to the field of ICAI, Dr. Brown
has authored or co-authored over 50 articles in this field. One of
his most recent contribution is @i Intelligent Tutoring Systems, with
Derek Sleeman. As an expert, he is often asked to speak in front of
Congressional committees and to participate on panels of the National
Academy of Science. He also has been appointed to several editorial
boards for such journals as @i Artificial Intelligence, Journal of
Educational Computing and Cognitive Science.!
Dr. Richard Burton (Ph.D, computer science, UC. Irvine, 1976) has been
exploring the use of AI technologies for education and training for the
past 14 years. He has pioneered techniques for student modelling,
computer coaching, machine diagnosis and improving human-computer
interface methods ranging from natural language to bitmap graphics. He
has developed prototypical learning systems for teaching electronic
trouble shooting (SOPHIE), for coaching educational games (WEST) , for
modelling and diagnosing errors in procedural skills (BUGGY and DEBUGGY)
and for improving the educational effectiveness of manipulative
mathematics environments (BLOCKS). Recently, Dr. Burton has been
involved in the development of low-cost, personal Lisp machines to
enable deployment of ICAI systems. He is responsible for the design and
implementation of the Interlisp-D window package.
He has been a member of the research staff at Xerox Palo Alto Research
Center since 1978.
Dr. William J. Clancey is a Research Associate in Computer Science at the
Heuristic Programming Project of Stanford University. He has been active
in work on explanation and tutoring systems since he joined the MYCIN
project in 1975, for which he was co-developer of the antibiotic therapy
and question-answering programs. He received a Ph.D in Computer Science from
Stanford in 1979. Now co-director of the GUIDON/NEOMYCIN tutoring project,
his interests lie in computational modeling of problem solving, particularly
medical diagnosis, and the design of architectures for expert systems to
facilitate construction, explanation, and multiple use. Clancey has
published widely on tutoring and expert system methodology, and is the
co-author (with E. H. Shortliffe) of@i "Readings in Medical Artificial
Intelligence: The First Decade, published by Addison-Wesley. He is also
a founding consultant and Director of Teknowledge.
!
TUTORIAL NO. 3: NATURAL LANGUAGE PROCESSING
Monday, August 6th, 1984
2:00 - 6:00 p.m.
PREFACE
The field of natural language processing is producing dramatic solutions
to a wide range of user-interface problems in commercial computing
applications. Vast amounts of information stored in traditional databases
can now be accessed by users who have no background training in computer
programming or formal query languages. Natural language interfaces can also
be designed for a variety of software applications that were previously
available to programmers. Yet the state of the art is still constrained
by a number of very difficult problems that remain to be solved. In this
tutorial, we will discuss what can and can't be done in an effort to
acquaint senior managers and research coordinators with the current
technology in natural language processing systems.
CONTENT
This tutorial will survey the state of the art in computer-based language
processing. It will review current and potential applications of
natural language research, introduce theoretical issues and processing
techniques, present a survey of commercial systems and present recommendations
on the requirements for a successful research environment.
SPECIFICS
This tutorial will examine:
(1) An overview of existing and potential applications: machine
translation aids, database interfacing, interviewing and advisory
systems, text analyzers, intelligent computer-aided instruction.
(2) The theoretical problems: syntax, semantics, inference,
domain-dependence vs. domain-independence.
(3) Popular processing techniques: syntactic parse trees, lexical case
frames, predicate calculus, conceptual decomposition, predictive
knowledge structures, context-driven analysis.
(4) A survey of commercially available systems: capabilities and
limitations, resource requirements, maintenance and extensibility.
(5) Establishing a research environment: computing resource requirements,
locating personnel, realistic time frames.
(A comprehensive list of references will be organized by tutorial
topics and distributed to all participants)
INTENDED AUDIENCE
This is an introductory tutorial suitable for (1) technical managers
who need to evaluate the capabilities and costs of commercial natural
language processing technology, and (2) senior managers who are new to
the field and want to establish in-house projects in the area of
natural language processing. No previous background in linguistics is
assumed, although some familiarity with computers is desirable.
LECTURER
Dr. Wendy Lehnert is an Associate Professor of Computer and
Information Science at the University of Massachusetts where she
specializes in natural language processing and cognitive models of
human thought processes. She has published extensively in these
areas, including two books,@i The Process of Question Answering, and
Strategies for Natural Language Processing, with Martin Ringle.
Formerly a Vice President for research at Cognitive Systems, Professor
Lehnert has designed commercial natural language processing systems
and worked with a number of major corporations in developing
applications for the existing technology.
!
TUTORIAL NO. 4: BUILDING EXPERT SYSTEMS: PART 1 - FUNDAMENTALS
Tuesday, August 7, 1984
9:00 a.m. to 1:00 p.m.
PREFACE
A major goal of Artificial Intelligence has been to develop
computer systems to perform intellectual tasks which are currently
performed by highly skilled experts. In the past few years, this goal
has come dramatically closer, and in limited cases has been achieved.
Understanding the basic principles of how such expert systems work and
how they may be applied is becoming increasingly important for
forecasting and influencing the future shape of technology in
industry, education, science, government and commerce.
CONTENT
The tutorial will review the state of the art and future
prospects for building computer systems which perform expert tasks
automatically, and systems which are used interactively by experts to
amplify their productivity. The emphasis will be on the fundamental
issues and technical considerations in building expert systems, across
a wide range of domains.
Part 1 may be taken as a self-contained introduction to the topic, or as
a preparation for Part 2.
SPECIFICS
The tutorial covers the basic steps in developing an
expert system:
(1) Problem selection and bounding: What are the features of an
intellectual task which make it more or less amenable to existing
expert systems technology?
(2) System architecture selection: The programming techniques used in
constructing expert systems differ markedly from those of conventional
numerical and data processing. We cover the various formalisms
currently available for encoding knowledge, such as semantic networks,
inference rules, production rules, frames, plans and scripts. Given
a programming formalism, how should one choose or design facilities
for reasoning about knowledge in that formalism?
(3) Knowledge acquisition: Should the knowledge be acquired by
debriefing experts, incrementally through experts' critiques of the
system, automatically by machine learning, or through some combination
of these methods? What are the techniques for each of these knowledge
acquisition paradigms? What tools can aid the design, construction
and modification of large knowledge bases?
(4) System evaluation and amelioration: How can expert systems be
compared, or have their performance judged on an absolute scale? The
reason for this is not merely evaluation for its own sake, but an
integral part of the process of building expert systems. Typically
the developers repeatedly return to the first or third step in this
list; why, when, and how is this carried out?
INTENDED AUDIENCE
This is an introductory tutorial suitable for those who desire an
understanding of how AI techniques can be used to solve difficult
real-world problems. Those who wish to evaluate the potential for
using expert systems in their own area of work, or who intend to
develop or manage such efforts, should also take Part 2.
LECTURERS
Dr. John McDermott is a Senior Research Computer Scientist and the
Associate Head of the Computer Science Department at Carnegie-Mellon
University. Before coming to Carnegie-Mellon in 1974, he was an
Assistant Professor of Philosophy at Eisenhower College (1969-1974).
He received a Ph.D. in philosophy from the University of Notre Dame in
1969 after receiving a B.A. and M.A. from St. Louis University.
His research interests are in the area of artificial intelligence,
particularly in the application of AI techniques to industrial
problems and in developing computer programs that simulate human
cognitive processes. He is the author of over 40 papers and
technical reports on these subjects.
Since 1978 the primary focus of his efforts has been in addressing
the problems involved in developing "expert systems" -- computer
programs that contain the wealth of domain-specific knowledge that
human experts require in order to function effectively. In 1980 he
completed work on R1, a program used by Digital Equipment
Corporation's manufacturing organization to configure computer
systems. Since that time, he and his colleagues have developed a number
of expert systems in a variety of domains. These systems include a computer
system sizing assistant, manufacturing management assistants, a drilling
fluid consultant, a threat assessment system and a VLSI design assistant.
The other lecturer is Dr. Douglas Lenat (see biographical sketch
earlier.)!
TUTORIAL NO. 5: BUILDING EXPERT SYSTEMS - PART 2: PRAGMATICS
Tuesday, August 7, 1984
2:00 p.m. to 6:00 p.m.
PREFACE
Increased productivity demands and a shortage of human experts have
caused the pioneering development of expert systems in the areas of
manufacturing, engineering,medicine and technical training. This
tutorial will also cover real-world issues most critical to the
successful development of expert systems; e.g. the requirements and
current availabilities of hardware, software and personnel.
CONTENT
The tutorial builds on Part 1 by presenting several in-depth case
studies of expert systems in different domains. Case studies will
be drawn from both existing and current research. This tutorial
will emphasize what has been learned about the domains of manufacturing,
engineering, medicine and technical training from an AI perspective,
and an examination of the techniques developed in each area. Additional
general topics, such as hardware and software requirements, personnel
needs and timetables will also be discussed.
SPECIFICS
This tutorial will examine:
(1) AI in Manufacturing: Expert Systems for aiding sales,
defining the customer's needs, designing a product that
meets those needs and assisting with monitoring and correcting
the unexpected situations that arise during the manufacturing
process.
(2) AI in Engineering: Intelligent systems to support the design and
troubleshooting of hardware and software; equipment configuration;
interpretation of oil drilling logs and other petroleum engineering
data.
(3) AI in Medicine: Interactive systems for advising antibiotic
therapy;disease diagnosis from symptoms;
generating explanations and
justifications for medical personnel.
(4) AI in Technical Training: Intelligent aids for teaching trouble-
shooting of complex devices such as electrical circuits; training
operators of industrial equipment.
(5) Pragmatics: Advice on starting a project, system building tools;
hardware options.
LECTURERS
Dr. John McDermott and Dr. Douglas Lenat ( see biographical sketches earlier).
!
TUTORIAL NO. 6: A TUTORIAL ON LISP
Tuesday, August 7
9:00 a.m. to 1:00 p.m.
PREFACE
LISP, created more than 25 years ago, is one of the earliest
programming languages. Although it has never been standardized, and for
most of its history was unsupported by any computer manufacturer, today
it enjoys increasingly widespread use and active development. The reason is
that LISP is the working language of the Artificial Intelligence community.
Through the work of major AI research centers, LISP evolved from a simple
list processor based on Church's lambda calculus into what is now widely
acknowledged to be the most advanced programming environment in existence.
Most research in expert systems, natural language understanding, cognitive
simulation, and real-world knowledge representation, and application work in
robotics and machine perception utilizes LISP, or languages based on
LISP. Familiarity with LISP is a prerequisite to any in-depth understanding
of AI and its special programming techniques.
CONTENT
The tutorial will explore the features that distinguish LISP
from conventional programming languages, assess its importance in AI
research today and in the future and teach some elementary LISP
programming.
SPECIFICS
The tutorial will examine:
(1) A brief history of LISP, including a comparison of the major
dialects in use.
(2) Why LISP is different: the crucial importance of symbols and
lists as primitive datatypes.
(3) The LISP interpreter: programs as data; the advantages of
interpretive execution; how automatic storage allocation and
garbage collection are implemented and why they are necessary.
(4) How LISP facilitates recursive, applicative, rule-based,
and object-oriented approaches to programming.
(5) The LISP programming environment: exploratory programming style;
LISP-based editors and debuggers; windows, flavors, and other
advanced features.
(6) Elementary LISP programming.
SPACE IS LIMITED AT THIS TUTORIAL.
INTENDED AUDIENCE
The tutorial is intended for technical professionals planning to
become involved in artificial intelligence projects, and for managers who
will oversee the development of AI applications. It is also appropriate for
students of AI or cognitive science who wish to pursue an in-depth study of
those fields. It is assumed that attendees have experience with at least
one conventional programming language.
LECTURER
Dr. David Touretzky is a research associate in computer science at
Carnegie-Mellon University. He received a Ph.D. from Carnegie-Mellon in
1984 in Computer Science. Dr. Touretzky is the author of @i[LISP: A Gentle
Introduction to Symbolic Computation,] and @i[A Summary of MacLISP
Functions and Flags]. He is the creator of Carnegie-Mellon's novel
LISP-based introductory programming course, where LISP's interactive nature
and advanced datatypes and built-in functions aid humanities students in
their first exposure to computing. Dr. Touretzky's research for the last
five years has been on the semantics of NETL, a massively parallel
knowledge representation system, and on the mathematics of inheritance
hierarchies. He is presently a member of CMU's Boltzmann Machine research
group, where he is investigating the application of stochastic neural
network architectures to symbolic reasoning.
!
TUTORIAL NO. 7 : ARTIFICIAL INTELLIGENCE PROGRAMMING TECHNIQUES
Tuesday, August 7, 1984
2:00 to 1:00 p.m.
PREFACE
Most AI workers still find LISP to be the most convenient tool for
expressing their algorithms. LISP, however, is a fairly
general purpose language and thus most AI applications require
programming techniques which are above the level of basic LISP, but
below that of the particular application. Often there are existing
packages to help, but these rarely do exactly what you want. Thus
the AI programmer must know how to build the tools of his trade.
CONTENTS
This tutorial will look at many of the basic techniques which underlie
programs in many AI application areas: expert systems, natural
language comprehension, problem solving, and so forth. These tools
solve basic programming problems which crop up all of the time:
pattern matching, efficient data retrieval under various
circumstances, and scheduling activities, to name but a few. This
tutorial will explain the basic ideas, and then go into the actual
code which implements the ideas.
SPECIFICS
This tutorial will examine the following questions:
(1) Why AI programming packages almost never do what you
want.
(2) What tools are needed for building expert systems?
(3) Basic pattern matching: unification and its extensions.
(4) Creating a data base: property lists, associative net-
works, and discrimination nets.
(5) Inference techniques: backward and forward chaining.
(6) What to do next: agendas and backtracking.
(7) Explaining what you know: data dependencies.
INTENDED AUDIENCE
This tutorial is intended for people who have had some experience with
AI and LISP and who want to be able to write sophisticated AI programs
in LISP. It is not necessary to be a good Lisp programmer to
understand the material, but one should have a "reading acquaintance"
with the language.
SPACE IS LIMITED FOR THIS TUTORIAL.
LECTURER
Dr. Eugene Charniak is an Associate Professor of Computer Science and
Cognitive Science at Brown University. He has published several
dozen articles on parsing natural language, knowledge representation
and story comprehension. He has published two books, @i Computational
Semantics, with Yorick Wilks; and @i Artificial Intelligence Programming,
with Chris Riesbeck and Drew McDermott. An introductory text book on
Artificial Intelligence, coauthored with Drew McDermott, is nearing
completion. Dr Charniak is also an editor of the journal, @i Cognitive
Science.
!
LECTURERS
AAAI-84 CONFERENCE
HOUSING ACCOMMODATIONS
****************************************************************************
* * *
JESTER CENTER * SHERATON-CREST INN * VILLA CAPRI * Hyatt Hotel
UNIVERSITY OF TEXAS * Congress & First Sts.* 2400 North IH 35 * 208 Barton
P.O. Box 7666 * Austin, Texas 78701 * Austin, Texas 78705* Springs
Austin, Texas 78712 * (512) 478-9611 * (512) 476-6171 * Austin, TX
(512)471-3136 78704
(512)477-1234
******************************************************************************
This year, the AAAI offers housing on the University of Texas campus
and at local hotels. Housing reservations will be processed by either
the University of Texas's housing staff for dormitory rooms or by the
Austin Chamber of Commerce's Central Housing Bureau for local hotel
rooms. Two separate housing forms are located in the back of the
brochure.
JESTER CENTER, University of Texas campus
The University of Texas's Jester Center will be the principal location
for housing during AAAI-84 National Conference. The Jester Center is a
high-rise residence hall and academic complex which accommodates a
maximum of 3,000 persons in double rooms. A total of 1,000
spaces have been reserved for the AAAI-84 Conference.
Summer conference accommodations are offered to University-sponsored
groups as a package rate including both meals and a room. The type of
room is designated as either connecting or community bath space.
Rooms with connecting bath space share these facilities with the
adjacent room only and receive daily housekeeping service, which
includes making the bed. Community bath facilities are shared by
approximately twelve rooms. Rooms served by community bath receive
housekeeping service every fourth day. In addition to twin beds, each
room has two desks with chairs, two chests of drawers, ample closet
space, and a lavatory. Bed and bath linens are normally provided; bath
linens are exchanged daily; bed linens are exchanged after the third
day of the conference.
Meals will be served cafeteria-style in an area of the Jester Center
Dining Room. Usual meal hours are 7:00 a.m. to 8:15 a.m. for
breakfast, 12:30 a.m. to 2:00 p.m. for lunch, and 5:00 p.m. to 6:15
p.m. for dinner. Lunch and dinner will feature a choice of two
entrees and two vegetables, salad bar with green salad and choice of
dressing and daily selection of vegetable, gelatin, and fruit salad,
assorted breads, beverages, and desserts. The first meal provided
will be dinner on August 5.
Reservations will be made directly with the Division of Housing and
Food Service (send in the attached dorm housing form) and confirmed by
mail if received two weeks in advance of the conference.
EVERY EFFORT WILL BE MADE BY THE DIVISION OF HOUSING AND FOOD
TO ACCOMMODATE RESERVATIONS RECEIVED AFTER JULY 23, 1984, BUT NO
SPACE WILL BE HELD FOR THE GROUP BEYOND THAT DATE.
Full payment of the package rate by cash, money order, check or
traveler's check will be expected at the time of the check-in. NO
CREDIT CARDS, FOREIGN CURRENCY AND FOREIGN CHECKS WILL BE ACCEPTED.
There are no refunds for late arrival, early departure or missed
meals. Check-out time is 2:00 p.m.
**************************************************************************
Jester Center is located at the corner of Speedway and Twenty-First Streets
on the University of Texas at Austin Campus. From Interstate highway 35, take
Martin Luther King Blvd west to Speedway. Automobile parking is available
as space permits in "C" lots 67 (first two rows only), south of Jester Center,
and in Lots 69 and 70, south and east of Memorial Stadium. Temporary "C"
permits, allowing conference attendees to park only in "C" parking areas,
are issued with the room confirmation or at the time of check-in at
Jester Center. Car license plate number is required prior to issuance of
a permit. "C" permits allow parking only in lots designated for "C" permit
holders, 7:30 a.m. to 5:00 p.m., Monday - Friday. The permits do not
allow attendees to drive through UT police manned control stations to
the inner campus until after 5:00 p.m. After 5:00 p.m. and on Saturday and
Sunday, attendees may park in any parking area not otherwise prohibited
by a posted sign.
***************************************************************************
JESTER CENTER HOUSING RATES
Single Occupancy Double Occupancy
Community Connecting Community Connecting
FULL WEEK $163.16 $181.91 $131.91 $144.41
(8/5 p.m.-
8/19 p.m.)
Meals:
8/5- dinner only
8/6-9 - 3 meals/day
8/10 - breakfast/lunch
only
PARTIAL WEEK
8/5 p.m. Arrival - $95.36 $106.61 $ 76.61 $84.11
8/8 p.m. Departure
Meals:
8/5 - dinner only
8/6-7 - 3 meals/day
8/8 - breakfast only
PARTIAL WEEK
8/6 p.m. Arrival - $129.71 $144.71 $104.71 $114.71
8/10 p.m. Departure
Meals:
8/6 - dinner only
8/7-8 - 3 meals/day
8/9-10 - breakfast, lunch
only
*****************************************************************************
!
HOTELS AND MOTELS IN AUSTIN
In addition to reserving spaces in Jester Center, the AAAI has reserved blocks
of rooms at local hotels. Those hotels are the Sheraton-Crest Inn, the Villa
Capri and Hyatt-Austin.
At all three hotels, rooms are reserved under the name of the
"American Association for Artificial Intelligence."
PLEASE NOTE ALL CUT-OFF DATES FOR MAKING ROOM RESERVATIONS (if appropriate);
RESERVATIONS RECEIVED AFTER THE CUT-OFF DATE WILL BE CONFIRMED ON A SPACE AND
RATE AVAILABILITY BASIS.
Sheraton-Crest Inn
Congress & First Sts.
Austin, TX 78701
(512) 478-9611
225 rooms are reserved beginning August 5 to August 10, 1984.
The conference room rates are:
* Single $50
* Double $55
* Triple $57
* Quad $60
The cut-off date for reservation and for the conference room rate
is JULY 23, 1984.
VILLA CAPRI
2400 North IH 35
Austin, TX 78705
(512) 476-6171
(800) 528-1234
225 rooms are blocked at the Villa Capri from August 5 to August 10,
1984. Large deluxe suites are available. The room rates follow:
* Single - one bed,one person - $42
* Double - one bed, two persons - $47
* Double-Double - two beds, two persons - $52
* each additional person - $5
Reservations will be held until 4:00 p.m. without deposit. If
arrivals occur after 4:00 p.m., the room must be guaranteed by
cash or credit card (American Express, Master Card and VISA).
Check-in time is 2:00 p.m.and check-out time is 12:00 p.m. noon.
Hyatt Regency Austin
on Town Lake
208 Barton Springs
Austin, Texas 78704
(512) 477-1234
A limited number of sleeping rooms have been reserved at the
Hyatt, although hospitality suites are available from August
7 to August 10, 1984. The conference room rates are:
* Single - $69.00
* Double - $79.00
* Triple - $84.00
* Quad - $92.00
The cut-off date is JULY 15, 1984. After that date,
reservations requests will be accepted according to room
availability.
ADDITIONAL MOTELS AND HOTELS IN AUSTIN
Advanced reservations are recommended for the following hotels and
motels in Austin. AAAI makes no representation regarding these or any
other housing facilities. Because the conference is not staffed to
process housing requests for these hotels, hotel reservations must be
made directly by conference attendees for these hotels and motels.
Ace Motel 2601 South Congress, 19 units (512) 442-1329
Austin Motel 1220 South Congress, 56 units (512) 444-0501
Driskill Hotel 117 E. 7th , 160 units (512) 474-5911
Hilton Inn IH35, 121 units (512) 451-5757
Holiday Inn-
Town Lake 20 N. IH35, 173 units (512) 472-8211
La Quinta 7100 n. IH35, 115 units (512) 452-9401
Quality Inn/ 2200 S. IH35, 178 units (512) 444-0561
South
Rodeway Inn- 2900 N.IH35, 50 units (512) 477-6395
University
Travelodge 4323 S. IH35, 100 units (512) 447-5511
All hotel rooms will be assessed an additional 7% city/state sales
tax.
AAAI-84 CONFERENCE REGISTRATION FORM (Only one form per person)
(use this form to register for all parts
of the AAAI-84 Conference)
NAME←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
ADDRESS←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
Telephone No. (where you can be reached if we have a problem
with your registration form) ←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
AFFILIATION ←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
TECHNICAL CONFERENCE REGISTRATION
(August 7 to 10, 1984)
*********************************************************************
Early Registration (Postmarked by June 18)
AAAI Member
Regular $100 ←←←←←←←←
Student $ 70 ←←←←←←←←
Non-Member
Regular $140 ←←←←←←←←
Student $ 85 ←←←←←←←←
Late Registration (Postmarked by July 18)
AAAI Member
Regular $130 ←←←←←←←←
Student $ 85 ←←←←←←←←
Non-Member
Regular $165 ←←←←←←←←
Student $105 ←←←←←←←←←
(Students please submit verification of registration).
Technical Conference Registration
Subtotal ←←←←←←←←
!
*********************************************************************
*********************************************************************
Tutorial Program Registration
August 6 to 7, 1984
Tutorial No. 1: An Overview of Artificial Intelligence
Early Registration (postmarked by June 18)
Regular $175 ←←←←←←←←
Student $ 75 ←←←←←←←←
Late Registration (postmarked by July 18)
Regular $200 ←←←←←←←←
Student $100 ←←←←←←←←
Tutorial No. 2: Applications of AI to Training and Education
Early Registration (postmarked by June 18)
Regular $175 ←←←←←←←←
Student $ 75 ←←←←←←←←
Late Registration (postmarked by July 18)
Regular $200 ←←←←←←←←
Student $100 ←←←←←←←←←
Tutorial No. 3: Natural Language Processing
Early Registration (postmarked by June 18)
Regular $175 ←←←←←←←←
Student $ 75 ←←←←←←←←
Late Registration (postmarked by July 18)
Regular $200 ←←←←←←←←
Student $100 ←←←←←←←←
Tutorial No. 4: Building Expert Systems - Part 1: Fundamentals
Early Registration (postmarked by June 18)
Regular $175 ←←←←←←←
Student $ 75 ←←←←←←←
Late Registration (postmarked by July 18)
Regular $200 ←←←←←←←
Student $100 ←←←←←←←
Tutorial No. 5: Building Expert Systems - Part 2: Pragmatics
Early Registration (postmarked by June 18)
Regular $175 ←←←←←←←←
Student $ 75 ←←←←←←←←←
Late Registration (postmarked by July 18)
Regular $200 ←←←←←←←←
Student $100 ←←←←←←←←
Tutorial No. 6: LISP Programming
Early Registration (postmarked by June 18)
Regular $175 ←←←←←←←
Student $ 75 ←←←←←←←
Late Registration (postmarked by July 18)
Regular $200 ←←←←←←←
Student $100 ←←←←←←←!
Tutorial No. 7: AI Programming Technology
Early Registration (postmarked by June 18)
Regular $175 ←←←←←←←
Student $ 75 ←←←←←←←
Late Registration (postmarked by July 18)
Regular $200 ←←←←←←←←
Student $100 ←←←←←←←←
PLEASE NOTE: SOME TUTORIALS ARE HELD CONCURRENTLY.
Tutorial Program Registration
Subtotal ←←←←←←←←
*************************************************************************
*********************************
* FIESTA RESERVATION(S) *
* THURSDAY, August 9
* $ 18.00/person *
* Subtotal ←←←←←← *
* *
*********************************
*****************************
* GRAND TOTAL ←←←←←←←←←←←←←*
*****************************
**************************** ****************************************
* Membership Application * * HOW TO REGISTER:
* * * (1) Make payment payable to AAAI
* New Application * * and
* Application Renewal * * (2) Send this form and your payment to
* * *
* NAME ←←←←←←←←←←←←←←←←←←← * * AAAI-84
* ADDRESS ←←←←←←←←←←←←←←←← * * American Association for
* ←←←←←←←←←←←←←←←←←←←←←←←← * * Artificial Intelligence
* AFFILIATION ←←←←←←←←←←←← * * 445 Burgess Drive
* ARPANET ←←←←←←←←←←←←←←←← * * Menlo Park, CA 94025
* * ********************************************
* Check as Appropriate:
* Regular Member/$25.00
* Student Member/$15.00
* (Photo copy of student ID
* required)
* Academic/Corporate
* Library Subscription
* $100
* Check here if you are
* interested in receiving
* information about the AAAI
* sub-group, Artificial Intell-
* igence in Medicine.
*
* A check should be payable to
* AAAI. Send this form and your
* payment to:
* AAAI
* 445 Burgess Drive
* Menlo Park, CA 94025
**********************************
-------
∂17-Jan-84 1835 Solomon.Datanet@MIT-MULTICS.ARPA
Received: from MIT-MULTICS by SU-AI with TCP/SMTP; 17 Jan 84 18:35:26 PST
Date: Tuesday, 17 January 1984 16:55 est
From: Solomon@MIT-MULTICS.ARPA
To: John McCarthy <JMC@SU-AI.ARPA>
In-Reply-To: Message of 16 January 1984 19:03 est from "John McCarthy"
Message-ID: <840117215555.097105@MIT-MULTICS.ARPA>
I give a talk at the American Banking Assn meeting on Monday Feb 5. I
expect to arrive in the Bay Area on Saturday morning. Perhaps Tuesday or
Sunday afternoon? I am not intending to rent a car on this trip, so I
will depend on the Esspee to get me to Stanford. I'll call Friday night
or Sat morning.
Richard Solomon
∂18-Jan-84 1009 AAAI-OFFICE@SUMEX-AIM.ARPA reschedule next meeting
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 18 Jan 84 10:08:55 PST
Date: Wed 18 Jan 84 09:20:52-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: reschedule next meeting
To: Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
Feinler@SRI-NIC.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
It looks like Jake has a meeting with her contract monitor next monday
morning, Jan. 23. How about rescheduling it to monday p.m., say 2:00 p.m.
in room 301?
Sorry about the inconvenience,
Claudia
-------
I have a class from 1:15 to 2:05 Mon, Wed, Fri. 2:30 or even 2:15 would
be feasible.
∂18-Jan-84 1653 BSCOTT@SU-SCORE.ARPA "Learning Course"
Received: from SU-SCORE by SU-AI with TCP/SMTP; 18 Jan 84 16:53:36 PST
Date: Wed 18 Jan 84 16:38:21-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: "Learning Course"
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, can you tell me the name of the course which Doug Lenat taught
last year, and which you referred to as the "learning course" at yesterday's
meeting. I thought I could look it up later, but I'm not having much success.
He taught CS 229, Topics in Artificial Intelligence, and CS 224, Survey
of Research Topics in AI. I assume the learning course was one of these?
Thanks,
Betty
-------
I would ask him, although I would presume it would be CS229.
∂18-Jan-84 1751 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 18 Jan 84 17:51:50 PST
Date: Wed 18 Jan 84 17:41:23-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 18 Jan 84 17:00:00-PST
Thanks, John.
Betty
-------
∂18-Jan-84 2000 JMC*
Nicodemus
∂19-Jan-84 1508 AAAI-OFFICE@SUMEX-AIM.ARPA next meeting
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 19 Jan 84 15:08:17 PST
Date: Thu 19 Jan 84 15:06:57-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: next meeting
To: Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
Feinler@SRI-NIC.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
The next meeting will now be scheduled for 2:30 p.m. rather than
2:00 p.m. on Monday, Jan 23 in room 301.
Claudia
-------
∂19-Jan-84 1519 GOLUB@SU-SCORE.ARPA Meeting
Received: from SU-SCORE by SU-AI with TCP/SMTP; 19 Jan 84 15:19:49 PST
Date: Thu 19 Jan 84 15:19:49-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Meeting
To: FEIGENBAUM@SU-SCORE.ARPA, jmc@SU-AI.ARPA, ullman@SU-SCORE.ARPA
Please remember we have a meeting on Friday at 4:30. I hope you
can read the material I gave you last week. GENE
-------
∂19-Jan-84 1538 BSCOTT@SU-SCORE.ARPA ARPA Update
Received: from SU-SCORE by SU-AI with TCP/SMTP; 19 Jan 84 15:38:09 PST
Date: Thu 19 Jan 84 15:38:41-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: ARPA Update
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, TOB@SU-AI.ARPA, DCL@SU-AI.ARPA,
Wiederhold@SUMEX-AIM.ARPA
cc: DFH@SU-AI.ARPA, MAS@SU-AI.ARPA, RBA@SU-AI.ARPA, Atkinson@SU-SCORE.ARPA
The latest chapter is that Navelex will fund the current contract by about
$700,000 to last through 9/30/84. I have no official modification paperwork,
but it is rather certain that this will happen. I have no idea at the moment
just for what project(s) the funds are being allocated. Will have to wait and
see what the modification says.
In the meantime, I plan to guarantee expenditures on the McCarthy and
Wiederhold accounts, so that CSD-CF charges and salaries can be paid. If
further checking reveals that other accounts need guarantees, I will take care
of it. I don't plan to guarantee equipment expenditures.
I will welcome any comments, if you care to make any.
Betty
-------
∂20-Jan-84 0313 TRAUB@COLUMBIA-20.ARPA Re: computational linguistics at Columbia
Received: from COLUMBIA-20 by SU-AI with TCP/SMTP; 20 Jan 84 03:13:30 PST
Date: Fri 20 Jan 84 06:14:45-EST
From: Joseph F. Traub <TRAUB@COLUMBIA-20.ARPA>
Subject: Re: computational linguistics at Columbia
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 19 Jan 84 22:51:00-EST
John: I would be happy to talk to her. Would you have her give me a call to
arrange meeting. She can reach me at (212)280-4397 or (212)280-2736. Joe
-------
∂20-Jan-84 0825 WIEDERHOLD@SUMEX-AIM.ARPA Re: ARPA Update
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 20 Jan 84 08:25:35 PST
Date: Fri 20 Jan 84 08:30:26-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: ARPA Update
To: BSCOTT@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA
In-Reply-To: Message from "Betty Scott <BSCOTT@SU-SCORE.ARPA>" of Thu 19 Jan 84 15:43:38-PST
Thanks much, funny money is at least more manageable when it comes in
reasonable chunks. GioWhat fraction is that now of our total request?
Gio
-------
∂20-Jan-84 0900 JMC*
Fenaughty about planning committee
∂20-Jan-84 0936 KJB@SRI-AI.ARPA Planning for next year.
Received: from SRI-AI by SU-AI with TCP/SMTP; 20 Jan 84 09:35:55 PST
Date: Fri 20 Jan 84 09:18:56-PST
From: Jon Barwise <KJB@SRI-AI.ARPA>
Subject: Planning for next year.
To: briansmith@PARC-MAXC.ARPA, tw@SU-AI.ARPA, jmc@SU-AI.ARPA,
goguen@SRI-AI.ARPA, meseguer@SRI-AI.ARPA
cc: bmacken@SRI-AI.ARPA
Now that I am in charge of the foundations area, I think I should butt out
of the computation area planning. So you should each think about what can
and should be done to make the area exciting. After Betsy and Brian get
clear about the budget for that area (which is pretty flush compared to
other areas), you should have a meeting and decide who you want to go after.
For academic types, this is the time of year to make offers.
Jon
-------
∂20-Jan-84 1510 TRAUB@COLUMBIA-20.ARPA Re: computational linguistics at Columbia
Received: from COLUMBIA-20 by SU-AI with TCP/SMTP; 20 Jan 84 15:09:44 PST
Date: Fri 20 Jan 84 18:09:27-EST
From: Joseph F. Traub <TRAUB@COLUMBIA-20.ARPA>
Subject: Re: computational linguistics at Columbia
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 19 Jan 84 22:51:00-EST
John: System got clobbered just after I sent you reply to this message.
Please let me know if you received. Joe
-------
I got your message for Alice and transmitted it. She will phone you Monday.
∂20-Jan-84 1713 SJG dinner sometime?
might be a suitable chance to have a talk; some other venue if that's
inconvenient. Thanks...
∂20-Jan-84 1727 jbn@FORD-WDL1.ARPA Re: comments on 'obvious' algorithm
Received: from FORD-WDL1 by SU-AI with TCP/SMTP; 20 Jan 84 17:27:09 PST
Return-Path:<>
Date: 20-Jan-84 17:25:38-PST
From: jbn@FORD-WDL1.ARPA
Subject: Re: comments on 'obvious' algorithm
To: JMC@SU-AI.ARPA
Cc: jbn
While a check for bigrams is certainly simpler than one for trigrams,
it turns out that for the set of words in the Unix dictionary, bigram space
is 82% populated while trigram space is only 30% populated. If the
algorithm were based on bigrams, it would be much more difficult to
pick a psuedo-random letter string that would pass the test because a much
higher percentage of random strings would be rejected by the algorithm.
The present algorithm rejects about 12% of random eight character strings
(based on experiment). Checking bigrams would reject a much higher percentage,
so trigrams seem to be the unit of choice. Groups of four characters
(quadgrams?) would require a table 27 times larger, which would be
inconvenient. A formal analysis of this problem might be interesting.
I am much more concerned about the human engineering of the
approach, which is why I made the program available on SCORE. I have
received a large number of comments, some of which are useful. To date
no one has complained that they could not find any word that the
algorithm would accept, nor has anyone found the algorithm not restrictive
enough. This indicates that I am on the right track. Bear in mind that
the primary alternative to a restriction of this kind is machine-generated
passwords, which certainly would be more painful for users.
John Nagle
If bigrams are used, one would want to exclude only bigrams that
have a significant frequency. Doing this would probably give an acceptable
number of passwords of acceptable unobviousness. At least my experiments
with your program suggested this. Actually I'm not sure one wants to exclude
all words in the dictionary if one wants to be sure that people memorize
the passwords rather than write them down.
∂20-Jan-84 2226 JK
;I think I have found a very elegant way of doing all inductive definitions:
;it turns out that by doing primitive recursion on HIGHER TYPES
;you can solve the problems we discussed before
;here is for example flatten:
(get-proofs lispax prf prf jk)
(proof test)
(decl (arb arb1 arb2) (type: |?arbitrary|))
(decl bigfun (type: |@arb⊗@arb→@arb|))
(decl defined_fun (type: |ground→@arb|))
(decl (defined_fun atom_fun fun1 fun2) (type: |ground→@arb|))
;now state the (primitive recursive schema) for definition on ALL
;higher type functionals:
;note the use of the variable type in declarations;
;in this way we can specialize to ANY type.
;thus this axiom is really schema. It is the most general
;induction schema that I can formulate:
;the one with parameters follows trivially.
(axiom
|∀bigfun atom_fun.∃defined_fun.∀x y.(atom x ⊃ defined_fun(x)=atom_fun(x))∧
(defined_fun(x.y)=
bigfun(defined_fun(x),defined_fun(y)))|)
(label high_order_definition)
:now can define flatfun(x)=λy.flat(x,y)
;has to done explicitly since the unifier does not coerce
;variable types
(define flatfun |∀x y.(atom(x)⊃flatfun(x)=(λY.X.Y))∧
(flatfun(X.Y)=(λZ.(flatfun(X))((flatfun(Y))(Z))))|
(use high_order_definition
ue: ((atom_fun.|λx.λy.x.y|)
(bigfun.|λarb1 arb2.λz.arb1(arb2(z))|)) ))
(define flat |∀x y.flat(x,y)=(flatfun(x))(y)|)
;can verify sexp'ness as usual
(ue ((phi.|λx.∀z.sexp (flatfun(x))(z)|)) sexpinduction
(open flatfun))
;∀X Z.SEXP (FLATFUN(X))(Z)
(label simpinfo)
;the fact about flat
(trw |∀x y z.(atom(x)⊃flat(x,y)=x.y)∧(flat(x.y,z)=flat(x,flat(y,z)))|
(open flat flatfun))
;∀X Y Z.(ATOM X⊃FLAT(X,Y)=X.Y)∧FLAT(X.Y,Z)=FLAT(X,FLAT(Y,Z))
∂21-Jan-84 1001 CLT
I would like a day by myself
I will be back late this evening
∂21-Jan-84 1151 AMSLER@SRI-AI.ARPA Password Security Measures
Received: from SRI-AI by SU-AI with TCP/SMTP; 21 Jan 84 11:51:29 PST
Date: Sat 21 Jan 84 11:52:20-PST
From: Robert Amsler <AMSLER@SRI-AI.ARPA>
Subject: Password Security Measures
To: jmc@SU-AI.ARPA
One measure I've never seen anyone apply is to install a time-lock
mechanism in the system which the user could set to lock out all
logins to their account for specific time periods. Just as banks
use time-locks on vaults which prevent them from being opened over
night, users could specify their account shouldn't be accessible for
n-hours or n-days, or during specified hours of the day.
Bob Amsler
-------
∂21-Jan-84 1157 AMSLER@SRI-AI.ARPA
Received: from SRI-AI by SU-AI with TCP/SMTP; 21 Jan 84 11:57:33 PST
Date: Sat 21 Jan 84 11:58:24-PST
From: Robert Amsler <AMSLER@SRI-AI.ARPA>
To: JMC@SU-AI.ARPA
cc: AMSLER@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Sat 21 Jan 84 11:53:00-PST
Ah, but think of the frustration a time-lock would cause the vandals
if the account didn't APPEAR to be locked out... I.e. They could even
guess the correct password and it wouldn't work.
-------
∂21-Jan-84 1602 Mailer@USC-ECLC.ARPA census
Received: from USC-ECLC by SU-AI with TCP/SMTP; 21 Jan 84 16:02:02 PST
Date: 21 Jan 1984 1557-PST
From: SOROKA@USC-ECLC.ARPA
Subject: census
To: jmc@SU-AI.ARPA
In your Quarterly Message, you remark:
"The ratio of basic/applied is less in AI than in the older sciences
and than in computer science generally."
Have statistics been published to support this?
I'd be interested in seeing them.
How about the ratio of older/younger researchers?
I suspect that that ratio will distinguish AI as well,
but that in a while AI will assume the familiar distribution.
-------
∂21-Jan-84 1644 JK
To: JMC, JJW
I have a few new proof files in [prf,jk]:
Subst.lsp[prf,jk] does the definition and properties of subst
(the unification algorithm does require the pars arguments to appear last:
this is the reason for reversing arguments to subst)
Flat.lsp[prf,jk] does the definition and properties of flatten
Mapcar.lsp[prf,jk] does the definition and properties of mapcar on multiple lists
Distin.lsp[prf,jk] does the predicate distinct(a,b,c,..)=a≠b∧a≠c∧b≠c∧... for
arbitrary number of arguments.
Der uses now high order unification.
A bug or a feature?
Unrestricted Skolemisation is equivalent to Axiom of Choice.
Thus, we can verify it:
(proof foo)
(trw |(∀x.∃y.A(x,y))⊃(∃f.∀x.A(x,f(x)))| (der))
(∀X.(∃Y.A(X,Y)))⊃(∃F.(∀X.A(X,F(X))))
∂21-Jan-84 2110 ABADI@SU-SCORE.ARPA mtc quals
Received: from SU-SCORE by SU-AI with TCP/SMTP; 21 Jan 84 21:10:12 PST
Date: Sat 21 Jan 84 17:35:41-PST
From: Martin Abadi <ABADI@SU-SCORE.ARPA>
Subject: mtc quals
To: jmc@SU-AI.ARPA
Yesterday, I talked to Zohar about a reading list for quals, as I am still
interested in taking them (I hope my interest will not disappear as the
weather gets better...). Zohar says he would accept any list you propose,
and claims that that it to my advantage -- allegedly, you would make the
reading list concise. Anyhow, he is willing to discuss with you, but seems
to expect you to take the first step. Would you please? Thanks.
Martin
-------
∂22-Jan-84 1018 JMC*
Chudnovsky about jk invitation
∂22-Jan-84 1505 @MIT-MC:RMS@MIT-OZ
Received: from MIT-MC by SU-AI with TCP/SMTP; 22 Jan 84 15:05:09 PST
Date: Sun 22 Jan 84 18:05:53-EST
From: RMS%MIT-OZ@MIT-MC.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Tue 10 Jan 84 16:10:00-EST
I think GNU will meet most of your goals for an operating system,
except for virtual machine facility and support of arbitrary character sets
(the latter being something that depends on special hardware and therefore
not in my department). I will provide a version of TEX, but not SCRIBE
until I get around to writing a clone of SCRIBE.
-------
Part of support of arbitrary character sets depends on hardware, but
part of it also depends on editors, etc. For example, an editor that
supports arbitrary character sets must allow characters to have
variable length internal representations. Also, although I have not
used UNIX, what I have read about its defects on BBOARD makes me
somewhat skeptical of anything based on its external characteristics.
∂22-Jan-84 1828 FEIGENBAUM@SUMEX-AIM.ARPA AI courses for 1984-85
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 22 Jan 84 18:28:18 PST
Date: Sun 22 Jan 84 18:33:19-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: AI courses for 1984-85
To: jmc@SU-AI.ARPA, tw@SU-AI.ARPA, genesereth@SUMEX-AIM.ARPA,
lenat@SUMEX-AIM.ARPA, buchanan@SUMEX-AIM.ARPA, tob@SU-AI.ARPA
cc: shortliffe@SUMEX-AIM.ARPA, eengelmore@SUMEX-AIM.ARPA
Believe it or not, the deadlines for Courses and Degrees material is
rapidly approaching. Hence, AI faculty have got to get their act together
with regard to what courses are to be offered next year and who is
going to teach them and when.
Let me propose a meeting either on Friday 1/27 at 3:30 or Monday
1/30 at 3:30 in MJH (somewhere). Please respond ASAP so we can home
in on a meeting time.
Ted, you're welcome to help us plan, especially if you plan to
do any of th4e teaching next year. And even if you don't.
Ed
-------
Friday is possible but only 4:30 or later, because I'm lecturing
at IBM at 2pm. Monday is preferred. I plan to teach CS206 in
the Fall and CS226 in the Winter.
∂22-Jan-84 1953 GENESERETH@SUMEX-AIM.ARPA Re: AI courses for 1984-85
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 22 Jan 84 19:53:03 PST
Date: Sun 22 Jan 84 19:57:57-PST
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: Re: AI courses for 1984-85
To: FEIGENBAUM@SUMEX-AIM.ARPA
cc: jmc@SU-AI.ARPA, tw@SU-AI.ARPA, lenat@SUMEX-AIM.ARPA,
buchanan@SUMEX-AIM.ARPA, tob@SU-AI.ARPA, shortliffe@SUMEX-AIM.ARPA,
eengelmore@SUMEX-AIM.ARPA
In-Reply-To: Message from "Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>" of Sun 22 Jan 84 18:33:24-PST
Ed,
Monday at 3:30 is fine with me, but I can't make it on Friday due to
prior commitments. Also I think we should invite Rod Brooks.
mrg
-------
∂22-Jan-84 2231 FEIGENBAUM@SUMEX-AIM.ARPA Re: AI courses for 1984-85
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 22 Jan 84 22:31:04 PST
Date: Sun 22 Jan 84 22:36:07-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: AI courses for 1984-85
To: GENESERETH@SUMEX-AIM.ARPA
cc: jmc@SU-AI.ARPA, tw@SU-AI.ARPA, lenat@SUMEX-AIM.ARPA,
buchanan@SUMEX-AIM.ARPA, tob@SU-AI.ARPA, shortliffe@SUMEX-AIM.ARPA,
eengelmore@SUMEX-AIM.ARPA
In-Reply-To: Message from "Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>" of Sun 22 Jan 84 19:58:00-PST
oops, I forgot Rod! And I dont know his mailbox name. Would someone
forward my original message to him. It is beginning to look like
Monday Jan. 30 is better than Friday the 27th.
Ed
-------
Rod is ROD@SAIL.
∂23-Jan-84 1108 EENGELMORE@SUMEX-AIM.ARPA Re: AI courses for 1984-85
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 23 Jan 84 11:07:33 PST
Date: Mon 23 Jan 84 10:38:13-PST
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: Re: AI courses for 1984-85
To: FEIGENBAUM@SUMEX-AIM.ARPA
cc: GENESERETH@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA, tw@SU-AI.ARPA,
lenat@SUMEX-AIM.ARPA, buchanan@SUMEX-AIM.ARPA, tob@SU-AI.ARPA,
shortliffe@SUMEX-AIM.ARPA
In-Reply-To: Message from "Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>" of Sun 22 Jan 84 22:36:10-PST
I have forwarded your original msg to ROD@SU-AI with a note that Monday
looks better than Friday for such a meeting.
Ellie
-------
∂23-Jan-84 1123 jbn@FORD-WDL1.ARPA Obviousness of words
Received: from FORD-WDL1 by SU-AI with TCP/SMTP; 23 Jan 84 11:23:09 PST
Return-Path:<>
Date: 23-Jan-84 11:21:50-PST
From: jbn@FORD-WDL1.ARPA
Subject: Obviousness of words
To: JMC@SU-AI.ARPA
Cc: jbn
The primary reason for excluding all words in the dictionary is that
systems with encrypted but not otherwise protected passwords can be attacked
by obtaining the encrypted password file, running all available dictionaries
through the encryption algorithm, and looking for matches. See "Notes on
the Security of UNIX" (supplied as part of full UNIX documentation sets)
by, I think, Richey.
It is a difficult problem to detect guessable passwords without disallowing
too many reasonable passwords. My algorithm disallows about 12% of all 8-letter
sequences, and this 12% contains most of the English language. A more
elaborate algorithm might bring the 12% figure down, but 12% is reasonably
acceptable; a user has an 88% chance of coming up with an acceptable string
on the first try and about a 98.5% chance in two tries, provided that the
user is coming up with reasonably random strings. This seems to be a usable
rejection level.
I appreciate your thoughts on the subject; at present my own feeling
is that the handling of alphabetic sequences is acceptable but the handling
of nonalphabetic characters is not; a definition of non-obvious sequences
containing nonalphabetics depends heavily on the use of such sequences in
the user's culture; I presently disallow sequences formed entirely of
nonalphabetics having no strong ideas in this area. It is known that
numeric sequences must be disallowed, to prevent the use of telephone numbers,
license numbers (Richey, ibid.) and other personally significant numbers.
Beyond this, the local system conventions are significant.
As it happens, I use obsolete telephone numbers. My present password
is the number of a 1952 girl friend, or at least the way I remember
that number. In my judgment this is secure enough. A rigid rule
enforced by the installation preventing the use of telephone numbers
may reduce security by encouraging the user to keep the password in
a file somewhere. I didn't know about the problem of running the
dictionary against the file of encrypted passwords, so I'll have to
think more.
∂23-Jan-84 1207 JJW Names for EKL manual
∂16-Jan-84 1123 JK
∂16-Jan-84 1115 JMC
I would like to suggest the following sentence for the EKL manual
acknowledgement section. It would go right after the sentence about
discussions. This chain of previous efforts strongly affected the
suggestions I made and also affected FOL. "The project benefited
indirectly from experience with previous interactive theorem provers, most
recently Weyhrauch's FOL, but also from Milner's LCF, Diffie's PCHECK and
still earlier programs and papers by W. Weiher, P. Abrahams and J.
McCarthy."
JJW - I've put the sentence (the text in quotes) in the place mentioned. This
disturbs the style of that paragraph, which had spelled out people's first names
in other cases. Can you give me the first names of the people named in this new
sentence?
Richard, Robin, Whitfield, William, Paul and John
∂23-Jan-84 1224 JK
∂23-Jan-84 1222 JMC
I would like to leave as late as possible tomorrow from SF or SJO for 1pm arrival.
-----------
Perhaps you meant this for someone else?
∂23-Jan-84 1927 CLT
would you like to go to richard and yasuko's for dinner wed?
∂23-Jan-84 2000 JMC*
Abstract to Joe Halpern
∂24-Jan-84 1203 AAAI-OFFICE@SUMEX-AIM.ARPA lunch
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 24 Jan 84 12:03:36 PST
Date: Tue 24 Jan 84 11:46:47-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: lunch
To: JMC@SU-AI.ARPA, Genesereth@SUMEX-AIM.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
It looks like Alouette is now closed for lunch. I've now made
reservations for lunch at Trattoria Romana, 541 Bryant St
for noon on Thursday.
Claudia
-------
∂24-Jan-84 1208 LENAT@SU-SCORE.ARPA Re: AI courses for 1984-85
Received: from SU-SCORE by SU-AI with TCP/SMTP; 24 Jan 84 12:08:32 PST
Date: Tue 24 Jan 84 12:07:58-PST
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: Re: AI courses for 1984-85
To: FEIGENBAUM@SUMEX-AIM.ARPA
cc: jmc@SU-AI.ARPA, tw@SU-AI.ARPA, genesereth@SUMEX-AIM.ARPA,
buchanan@SUMEX-AIM.ARPA, tob@SU-AI.ARPA, shortliffe@SUMEX-AIM.ARPA,
eengelmore@SUMEX-AIM.ARPA
In-Reply-To: Message from "Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>" of Sun 22 Jan 84 18:29:22-PST
Either time is fine with me.
Doug
-------
∂24-Jan-84 1325 KJB@SRI-AI.ARPA newsletter
Received: from SRI-AI by SU-AI with TCP/SMTP; 24 Jan 84 13:24:57 PST
Date: Tue 24 Jan 84 13:27:22-PST
From: Jon Barwise <KJB@SRI-AI.ARPA>
Subject: newsletter
To: Jmc@SU-AI.ARPA
cc: goguen@SRI-AI.ARPA
John, If you have not done so, could you send dkanerva@sri-ai
a short paragraph about your seminar for next tuesday. Jon
-------
∂24-Jan-84 1600 CS.SIMMONS@UTEXAS-20.ARPA Circumscription
Received: from UTEXAS-20 by SU-AI with TCP/SMTP; 24 Jan 84 15:59:51 PST
Date: Tue 24 Jan 84 18:01:12-CST
From: CS.SIMMONS@UTEXAS-20.ARPA
Subject: Circumscription
To: jmc@SU-AI.ARPA
cc: cs.simmons@UTEXAS-20.ARPA
Dear Professor McCarthy,
Re your circumscription article in the AI Journal 1980.
My name is Charles Petrie and I am a graduate student at UT interested in
non-monotonic logic with a question about circumscription. In example
seven in the above article, in order to circumscribe the predicate
"prevents", a sentence must be constructed of all of the propositions that
might imply satisfaction of the predicate. It seemed to me that in this
example, to circumscribe the predicate was to assert that it was not
provable that there was a "z" such that "prevents (z, ..." which would not
be decidable. However, you noted that the goodness of the constructed
sentence depended on the program "finding all of the relevant statements"
which implies that the issue is only a practical matter.
In general, the seventh example suggested to me that circumscription was
equivalent to saying that an assertion could be assumed if it were
consistent to do so. I have talked with several people, but have found no
one who will admit to being sufficiently competent to even try to
"de-confuse" me on all of this. So I thought I would go to the source.
Any references or comments from you would be sincerely appreciated. Thank
you for your time and thought.
I can be reached via ARPANET at Dr. Simmons address. Or, I receive mail at
610 Rockpark Dr., Austin, TX 78746.
Sincerely,
Charles Petrie
-------
∂24-Jan-84 2352 FEIGENBAUM@SUMEX-AIM.ARPA Re: AI courses for 1984-85
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 24 Jan 84 23:52:04 PST
Date: Tue 24 Jan 84 23:56:44-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: AI courses for 1984-85
To: LENAT@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, tw@SU-AI.ARPA, genesereth@SUMEX-AIM.ARPA,
buchanan@SUMEX-AIM.ARPA, tob@SU-AI.ARPA, shortliffe@SUMEX-AIM.ARPA,
eengelmore@SUMEX-AIM.ARPA, rod@SU-AI.ARPA
In-Reply-To: Message from "Doug Lenat <LENAT@SU-SCORE.ARPA>" of Tue 24 Jan 84 12:12:47-PST
It looks like the 3:30pm Monday time is the best we can do. The roboticists
may have to come a bit late.
(Ellie, will you get us a conference room in MJH for the 3:30-5pm time slot
next monday afternoon, and message everyone on the above list as to what
room it is?)
Ed
-------
∂25-Jan-84 0507 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay knowledge seminar
Received: from SU-HNV by SU-AI with TCP/SMTP; 25 Jan 84 05:07:00 PST
Received: from rand-relay.ARPA by Diablo with TCP; Wed, 25 Jan 84 04:57:38 pst
Date: 24 Jan 1984 23:09:32-PST (Tuesday)
From: Joe Halpern <HALPERN.IBM-SJ@Rand-Relay>
Return-Path: <HALPERN.SJRLVM1.IBM-SJ@Rand-Relay>
Subject: knowledge seminar
To: KNOWLEDGE@SU-HNV
Cc: erhard.ucsc@Rand-Relay
Via: IBM-SJ; 25 Jan 84 2:10-PST
As previously announced, the second seminar on reasoning about
knowledge will take place on Friday, January 27, at 2 P.M., at IBM.
The speaker will be John McCarthy of Stanford. Here is an
abstract for the talk:
Several modal and first-order formalisms will be presented for expressing
facts about knowledge and belief. The novel features of these
formalisms arose from trying to express the reasoning involved in
solving the puzzle of the three wise men with spots on their foreheads
and the puzzle of Mr. S and Mr. P. These include the ability to
express that all a person knows are certain facts and to express
the effect of learning a fact. The relations among knowing that,
knowing what, and knowing about will be briefly discussed.
Due to a change in IBM security procedures, the gate by the research
building at IBM is only open from 8-9 AM, and again from 3-5:30 in
the afternoon. The only gate open all day is the main gate, further
up Cottle Rd. Here is a set of revised directions for getting to
IBM, which takes this into account:
Take 101 south and exit at Ford
Rd. (the exit is on the left, and comesafter Capitol Expressway and
Hellyer). Make a right off the exit ramp and after 100 yards or so turn
right onto a cloverleaf. Soon after
you exit this cloverleaf there will be yet another cloverleaf entrance
with a sign marked IBM. Take this cloverleaf too. After you exit the
second cloverleaf, turn right. (Ignore the sign that says IBM is straight
ahead. The gate that this sign is referring to will be locked in any
case.) You are now on Cottle Rd. Continue to the second traffic lights.
Turn left and enter by the main gate to IBM. Tell the security guards
that you are coming for the knowledge seminar which is being held
in the research building. To get to the research building from the
main entrance, take the first right, and go the equivalent of two
blocks to the white triangular building on your right, which is
just past the brown portables. There is visitor parking in the
front of the building, and extra parking in the rear. Again you will
have to register with the receptionist, who will point you to the
main auditorium where the seminar is being held.
We will continue holding the knowledge seminar on every second Friday,
starting at 1:30 rather than 2. The next speaker, on Febraury 10, will
be Ron Fagin from IBM.
∂25-Jan-84 0854 EENGELMORE@SUMEX-AIM.ARPA Monday Meeting
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 25 Jan 84 08:54:09 PST
Date: Wed 25 Jan 84 08:58:30-PST
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: Monday Meeting
To: LENAT@SU-SCORE.ARPA, jmc@SU-AI.ARPA, tw@SU-AI.ARPA,
genesereth@SUMEX-AIM.ARPA, buchanan@SUMEX-AIM.ARPA, tob@SU-AI.ARPA,
shortliffe@SUMEX-AIM.ARPA, rod@SU-AI.ARPA, Feigenbaum@SUMEX-AIM.ARPA
cc: EENGELMORE@SUMEX-AIM.ARPA
MJH 301 has been reserved from 3:30-5:00, Monday, January 30 for your
meeting.
-------
∂25-Jan-84 2120 rsw@cmu-ri-rover Reply to Jon's remark
Received: from CMU-RI-ROVER by SU-AI with TCP/SMTP; 25 Jan 84 21:19:52 PST
Date: 26 Jan 1984 00:24:40-EST
From: Richard.Wallace@CMU-RI-ROVER
To: Hans.Moravec@CMU-RI-ROVER, doyle@c, jmc@su-ai, shivers@h
Subject: Reply to Jon's remark
"Jon Doyle put it this way in a recent net message,
'...tentative, but disturbing conclusion: that the students
interested in AI are not very interested in fundamental
questions, open problems, and long-term research, but
instead are eager to get it on in big, build-it-now
projects in expert systems and natural language interfaces.'
He was definite about CMU..."
--John McCarthy
President's Quarterly Message
AI Magazine v.4 n.4. Winter 1983
Jon and John:
I simply cannot agree with this sweeping generalization.
In fact, evidence points to the contrary. During the
immigration course this year at CMU about two-thirds of the
27 first-year students indicated their primary interest in AI.
At least four of these students chose to work on the
Boltzmann Machine concept, something about as far from
a "big build-it-now" project as one can get. Others among
us are working in machine learning. Three first-year students are
working with Prof. Newell on research into a theoretical
Generalized Cognitive Architecture. A few of us have decided
to work on perception and manipulation, not in the area of
industrial applications but in basic research directed at
understanding how to build intelligent sensing and moving
machines.
To cite another counterpoint: We would not be students at
CMU or Stanford or MIT if our main interest were building AI
applications programs. It is quite possible with an undergraduate
or master's degree in computer science to find high-salaried
positions in any of a number of institutions working on AI
applications. One purpose of the Ph.D. is to become involved
in basic research. Among the graduate students here at CMU
there is no shortage of a desire to work on fundamental scientific
questions.
R/W
∂26-Jan-84 0907 NOVAK@SUMEX-AIM.ARPA I'm in PA
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 26 Jan 84 09:06:58 PST
Date: Thu 26 Jan 84 09:12:01-PST
From: Gordon Novak <NOVAK@SUMEX-AIM.ARPA>
Subject: I'm in PA
To: jmc@SU-AI.ARPA, clt@SU-AI.ARPA
I am visiting Palo Alto this week, and plan to visit CSD on Friday.
I'll be happy to talk with you then if you'd like.
Best regards, Gordon
-------
∂26-Jan-84 0939 AAAI-OFFICE@SUMEX-AIM.ARPA Fredkin Prize for Computer Math Discovery
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 26 Jan 84 09:39:23 PST
Date: Thu 26 Jan 84 09:39:44-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Fredkin Prize for Computer Math Discovery
To: Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA, Bledsoe@UTEXAS-20.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Bengelmore@SRI-KL.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Grosz@SRI-AI.ARPA,
Hart@SRI-KL.ARPA, JMC@SU-AI.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Stan@SRI-AI.ARPA, Stefik@PARC-MAXC.ARPA,
GJS@MIT-MC.ARPA, Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA,
Bonnie.upenn@UDEL-RELAY.ARPA, Fikes%usc-ecld@USC-ECL.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Please post this announcement.
Thanks,
Claudia
Fredkin Prize to be Awarded for Computer Math Discovery
LOUISVILLE, Ky.--The Fredkin Foundation will award a $100,000 prize for the
first computer to make a major mathematical discovery, it was announced today
(Jan. 26).
Carnegie-Mellon University has been named trustee of the "Fredkin Prize for
Computer Discovery in Mathematics", according to Raj Reddy, director of the
university's Robotics Institute, and a trustee of IJCAI (International Joint
Council on Artificial Intelligence) responsible for AI prizes. Reddy said the
prize will be awarded "for a mathematical work of distinction in which some of
the pivotal ideas have been found automatically by a computer program in which
they were not initially implicit."
"The criteria for awarding this prize will be widely publicized and reviewed by
the artificial intelligence and mathematics communities to determine their
adequacy," Reddy said.
Dr. Woody Bledsoe of the University of Texas at Austin will head a committee of
experts who will define the rules of the competition. Bledsoe is
president-elect of the American Association for Artificial Intelligence.
"It is hoped," said Bledsoe, "that this prize will stimulate the use of
computers in mathematical research and have a good long-range effect on all of
science."
The committee of mathematicians and computer scientists which will define the
rules of the competition includes: William Eaton of the University of Texas at
Austin, Daniel Gorenstein of Rutgers University, Paul Halmos of Indiana
University, Ken Kunen of the University of Wisconsin, Dan Mauldin of North
Texas State University and John McCarthy of Stanford University.
Also, Hugh Montgomery of the University of Michigan, Jack Schwartz of New York
University, Michael Starbird of the University of Texas at Austin, Ken
Stolarsky of the University of Illinois and Francois Treves of Rutgers
University.
The Fredkin Foundation has a similar prize for a world champion computer chess
system. Recently, $5,000 was awarded to Ken Thompson and Joseph Condon, Bell
Laboratories researchers who developed the first computer system to achieve a
Master rating in tournament chess.
-------
∂26-Jan-84 1538 AAAI@SU-SCORE.ARPA lunch with Manuck
Received: from SU-SCORE by SU-AI with TCP/SMTP; 26 Jan 84 15:38:49 PST
Date: Thu 26 Jan 84 15:38:15-PST
From: AAAI-OFFICE <AAAI@SU-SCORE.ARPA>
Subject: lunch with Manuck
To: Genesereth@SU-SCORE.ARPA, JMC@SU-AI.ARPA
cc: aaai@SU-SCORE.ARPA
I talked to Richard Manuck today to arrange for our next luncheon meeting.
He said he will not be available to meet until the week of Feb 6. We
tentatively arranged to meet for lunch on Tues., Feb 7 from 1-2:00 p.m.
Can you make that date and time?
Claudia
-------
1pm Feb 7 is ok for me.
∂27-Jan-84 0840 GOLUB@SU-SCORE.ARPA re: Ph D Admissions (from SAIL's BBOARD)
Received: from SU-SCORE by SU-AI with TCP/SMTP; 27 Jan 84 08:40:35 PST
Date: Fri 27 Jan 84 08:36:49-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: re: Ph D Admissions (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Fri 27 Jan 84 00:06:00-PST
John! I don't understand why this appeared on BBOARD. The original message
was sent by me to the FACULTY. GENE
-------
It was my fault that the faculty discussion spilled over onto bboard.
Brian Reid's message was such that I thought I was on BBOARD and I used
my OBBD macro that sends messages to other bboards. Oh well, no harm
done, I believe.
∂27-Jan-84 1108 LOUNGO@RUTGERS.ARPA RUTGERS TECHNICAL REPORTS
Received: from RUTGERS by SU-AI with TCP/SMTP; 27 Jan 84 11:08:30 PST
Date: 27 Jan 84 14:03:25 EST
From: LOUNGO@RUTGERS.ARPA
Subject: RUTGERS TECHNICAL REPORTS
To: Erman@SRI-KL.ARPA, SHORTLIFFE@SUMEX-AIM.ARPA, DREIFUS@WHARTON-10.ARPA,
bennett@SU-SCORE.ARPA, MITTAL@PARC-MAXC.ARPA, CHANDRASEKARAN@RUTGERS.ARPA,
JSMITH@RUTGERS.ARPA, WILKINS@SRI-KL.ARPA, BRUCE@BBNA.ARPA,
FRIEDLAND@SUMEX-AIM.ARPA, PLONDON@USC-ISIB.ARPA, RDG@SU-AI.ARPA,
PRESSBURGER@KESTREL.ARPA, CSD.GARDNER@SU-SCORE.ARPA, FAGAN@SUMEX-AIM.ARPA,
FIKES@PARC-MAXC.ARPA, JMC@SU-AI.ARPA, CLANCEY@SUMEX-AIM.ARPA,
KRD%MIT-OZ@MIT-ML.ARPA, HAMILTON.ES@PARC-MAXC.ARPA, AMSLER@SRI-AI.ARPA,
ChiNguyen.ES@PARC-MAXC.ARPA, lisa@UT-NGP.ARPA, kwh%MIT-OZ@MIT-ML.ARPA,
UTGOFF@RUTGERS.ARPA, TUROCK@RUTGERS.ARPA, ECG.RICH@DEC-MARLBORO.ARPA
cc: lounGO@RUTGERS.ARPA, PETTY@RUTGERS.ARPA
Below is a list of our newest technical reports.
The abstracts for these are available for access via FTP with user account
<anonymous> with any password. The file name is:
<library>tecrpts-online.doc
If you wish to order copies of any of these reports please send mail via the
ARPANET to PETTY@RUTGERS or LOUNGO@RUTGERS. Thank you!!
[ ] CBM-TR-135 PROGRAM SYNTHESIS AS A THEORY FORMATION TASK--PROBLEM
REPRESENTATIONS AND SOLUTION METHOD, S. Amarel.
[ ] DCS-TR-132 (REVISED) - HIGH ORDER NUMERICAL SOMMERFELD BOUNDARY
CONDITIONS: THEORY AND EXPERIMENTS, R. Vichnevetsky and
E.C. Pariser.
[ ] DCS-TR-133 SINGULAR INTEGRAL EQUATIONS-THE SINGULAR VALUE
DECOMPOSITION OF THE GAUSS-CHEBYSHEV AND LOBATTO-CHEBYSHEV
MATRICES, A. Gerasoulis.
[ ] DCS-TR-134 (THESIS) KNOWLEDGE REPRESENTATION IN MATHEMATICS A CASE
STUDY IN GRAPH THEORY, S.L. Epstein. (If you wish to order
this thesis, a pre-payment of $15.00 is required.)
[ ] DCS-TR-135 CLUSTERING AND DOMINATION IN PERFECT GRAPHS, D.G. Corneil
and Y. Perl.
[ ] DCS-TR-136 THE ENERGY FLOW EQUATION, R. Vichnevetsky.
[ ] DCS-TR-137 INVARIANCE THEOREMS CONCERNING REFLECTION AT NUMERICAL
BOUNDARIES, R. Vichnevetsky.
[ ] LCSR-TR-46 STREAM PROCESSING, R. Paige.
[ ] LCSR-TR-48 CONTROLLING SOFTWARE EVOLUTION AND OVERVIEW OF DARWIN,
N. Minsky and A. Borgida.
[ ] LCSR-TR-49 POWER AND ITS DISTRIBUTION IN SOFTWARE SYSTEMS, N. Minsky.
[ ] LCSR-TR-52 FEATURES OF LANGUAGES FOR THE DEVELOPMENT OF INFORMATION
SYSTEMS AT THE CONCEPTUAL LEVEL, A. Borgida.
-------
∂27-Jan-84 1110 GOLUB@SU-SCORE.ARPA Re: my goof
Received: from SU-SCORE by SU-AI with TCP/SMTP; 27 Jan 84 11:10:06 PST
Date: Fri 27 Jan 84 11:10:49-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Re: my goof
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Fri 27 Jan 84 11:07:00-PST
Of course, not. I was simply surprised to see your message on
BBOARD. GENE
-------
∂27-Jan-84 1556 DFH Keith Clark
Stopped by on his way to the airport. Left a
brochure for you.
∂27-Jan-84 2152 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay knowledge seminar
Received: from SU-HNV by SU-AI with TCP/SMTP; 27 Jan 84 21:52:41 PST
Received: from rand-relay.ARPA by Diablo with TCP; Fri, 27 Jan 84 21:48:48 pst
Date: 27 Jan 1984 15:56:21-PST (Friday)
From: Joe Halpern <HALPERN.IBM-SJ@Rand-Relay>
Return-Path: <HALPERN.SJRLVM1.IBM-SJ@Rand-Relay>
Subject: knowledge seminar
To: KNOWLEDGE@SU-HNV
Via: IBM-SJ; 27 Jan 84 18:26-PST
As announced at the seminar today, we'd like to run the knowledge
seminar on a once every other Friday basis, with two talks being
held each time. The question is whether we should meet on Friday
morning, from 10 AM to 12:20 (two one-hour talks with a 20 minute
coffee break) or from 1:30 to 3:50. Please let me know what you
would prefer by sending netmail to me at HALPERN@IBM-SJ on CSNET
or HALPERN.IBM-SJ@RAND-RELAY on ARPANET.
Thanks.
Regards,
Joe
If the seminar were held in the morning, I could come some of the
time.
∂28-Jan-84 0256 POURNE@MIT-MC
Received: from MIT-MC by SU-AI with TCP/SMTP; 28 Jan 84 02:38:15 PST
Date: 28 January 1984 05:40 EST
From: Jerry E. Pournelle <POURNE @ MIT-MC>
To: JMC @ SU-AI
In-reply-to: Msg of 27 Jan 84 2227 PST from John McCarthy <JMC at SU-AI>
They tell me better comes, first on radio Saturday AM and then
later.
Also, we got the FREE ENTERPRISE part into the STATE OF
THE UNION. Aint it grand?
Thanks for the help.
∂29-Jan-84 2305 FEIGENBAUM@SUMEX-AIM.ARPA dinner for Ben Kuipers
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 29 Jan 84 23:05:15 PST
Date: Sun 29 Jan 84 23:10:14-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: dinner for Ben Kuipers
To: jmc@SU-AI.ARPA
John,
Ben Kuipers is thinking of leaving Tufts, and the HPP is examining
the possibility of hiring him as a Senior Research Associate. He'll
be out for interviews on Feb. 23 and 24, and give a talk at lunch
on Fri. , Feb. 24. On Thursday, I will be having a dinner for him
(with Buchanan, Shortliffe, Genesereth, Rindfleisch, maybe others)
at the Faculty Club. Can you/ will you be our guest at that dinner too?
We would all be very much pleased to have you there.
Ed
-------
I will be in L.A. on Thursday, but I would like to get back on time
for the dinner for Ben Kuipers, but that depends on eventualities in
L.A. What time to you plan to begin?
∂30-Jan-84 0643 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay thanks
Received: from RAND-RELAY by SU-AI with TCP/SMTP; 30 Jan 84 06:42:57 PST
Date: 29 Jan 1984 15:50:31-PST (Sunday)
From: Joe Halpern <HALPERN.IBM-SJ@Rand-Relay>
Return-Path: <HALPERN.SJRLVM1.IBM-SJ@Rand-Relay>
Subject: thanks
To: JMC@SU-AI
Via: IBM-SJ; 30 Jan 84 5:15-PST
John,
I just wanted to thank you again for giving your talk at the knowledge
seminar on Friday. Hearing it reminded me once more what a great
intellectual debt all of us working in this field owe you.
I still disagree one one of your conclusions. My feelings might well
be described as "Modal logic, si! First-order logic, no!". The
translation of such intuitively simple statements as "All I know is P"
into first-order logic seems to me cumbersome and unnatural.
I hope that Yoram's write-up of our solution to the Mr. S. and Mr. P
puzzle and the cheating wives puzzle will help convince you of that.
This is a subject we will no doubt return to in the seminars. It looks
now as if they will be held in the mornings (the vote is currently 5-0
in favor). I hope this means we'll see you down here again in the
near future.
Regards,
Joe
∂30-Jan-84 0900 JMC*
Call Kingsley Davis 497-9384.
∂30-Jan-84 0956 fuzzy1@aids-unix Re: knowledge seminar
Received: from SU-HNV by SU-AI with TCP/SMTP; 30 Jan 84 09:53:53 PST
Received: from aids-unix by Diablo with TCP; Mon, 30 Jan 84 09:50:48 pst
Date: 30 Jan 84 09:41:27 PST (Mon)
From: Richard Tong <fuzzy1@aids-unix>
Subject: Re: knowledge seminar
To: HALPERN.IBM-SJ@Rand-Relay, KNOWLEDGE@SU-HNV
I prefer afternoons.
Richard.
∂30-Jan-84 1000 JMC*
broken earth
∂30-Jan-84 1114 JK proposal
To: "@SATO.DIS[1,CLT]"
I will prepare a rough draft of the proposal this week -
in order to do this I would like to have your curriculum vitae
ASAP.
See biojmc[1,jmc].
∂30-Jan-84 1119 FEIGENBAUM@SUMEX-AIM.ARPA
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 30 Jan 84 11:19:27 PST
Date: Mon 30 Jan 84 11:23:56-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Mon 30 Jan 84 10:24:00-PST
John, to tell the truth, I hadn't thought it through that deeply yet,
but I assume dinner will be at "normal" times, i.e. 6:30 or 7PM.
If you're later, it won't matter. The waitress will simply take your
order and serve you whenever you come.
Ed
-------
∂30-Jan-84 1219 JK cv
RPG says he did on in TEX format for you.
Where is that?
Maybe Diana can find it.
∂30-Jan-84 1446 RIEMEN@SU-SCORE.ARPA Knowledge Seminar time
Received: from SU-HNV by SU-AI with TCP/SMTP; 30 Jan 84 14:46:30 PST
Received: from SU-SCORE.ARPA by Diablo with TCP; Mon, 30 Jan 84 14:43:48 pst
Date: Mon 30 Jan 84 14:22:12-PST
From: Robert Riemenschnei <RIEMEN@SU-SCORE.ARPA>
Subject: Knowledge Seminar time
To: Halpern.IBM@RAND-RELAY.ARPA, Knowledge@SU-HNV.ARPA
I currently strongly prefer mornings, because
1) I'd rather hang around and chat in the early afternoon
than the late afternoon, and
2) I'd rather drive down in the mid-morning than the early
afternoon.
But these preferences are based on *very* limited experience with the local
traffic patterns. On the trip down for the first (morning) seminar, the
last five miles on 101 took five minutes to drive, while for the second
(afternoon)seminar, the five miles took over thirty minutes. If the delay
on the second trip was not characteristic, my preference is only weak for
mornings.
-- Bob
-------
∂31-Jan-84 1245 GOGUEN@SRI-AI.ARPA Re: seminar abstract
Received: from SRI-AI by SU-AI with TCP/SMTP; 31 Jan 84 12:45:13 PST
Date: Tue 31 Jan 84 12:47:11-PST
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: Re: seminar abstract
To: JMC@SU-AI.ARPA
cc: GOGUEN@SRI-AI.ARPA, meseguer@SRI-AI.ARPA, kjb@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 26 Jan 84 03:08:00-PST
this is just to let you know, at the request of jon barwise, that pepe
meseguer and i are in charge of the tuesday morning "C1" seminar.
thanks, joseph
-------
∂31-Jan-84 1542 DFH Richard Stark
He needs to have the recommendation letter there by Friday
(and will pay express mail charges to get it there). Can
you do one before you go to LA?
∂31-Jan-84 2030 DFH* Stoyan History papers
This is a reminder that you were going to look for these
at home.
∂31-Jan-84 2033 JJW Not me, but ...
It looks like the message was a reminder from DFH. By running PPSAV on
your screen, I got the following:
∂31-Jan-84 2032 JJW PPSAV'd text
*33 6
*3 6
*;; Message from DFH* Stoyan History papers
This is a reminder that you were going to look for these
at home.
e
*q
Type Y to confirm Quitting: y
End of SAIL execution
↑C
.send * Who just sent me a message. Please resend.
(Sending to ALL logged-in users. SEND LOCAL would omit dialups/netfolk;
SEND ARPA omits non-netfolk; SEND ** omits no one and skips this msg.)
;; Message to * from JMC (on TTY20 2031)
Who just sent me a message. Please resend.
Exit
↑C
.
∂01-Feb-84 1112 DFH Stark letter
He phoned this morning to say not to bother doing
at this point if you haven't already done it --
apparently the deadline was stricter than he realized.
∂01-Feb-84 1114 DFH Matt Nicodemus
Stopped by looking for your opinion piece that is to
run in the Daily. He would like it to run Mon. or Tues.
and they need it about 2 days ahead. I am to call him
when it is ready.
∂01-Feb-84 1223 BUCHANAN@SUMEX-AIM.ARPA COMTEX contract
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 1 Feb 84 12:22:57 PST
Date: Wed 1 Feb 84 12:26:39-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: COMTEX contract
To: jmc@SU-AI.ARPA, bscott@SU-SCORE.ARPA
cc: bgb@SUMEX-AIM.ARPA
I had a call from Phoebe Huang at Comtex after she had talked with
Bill Osborne in OTL about the contract for reprinting the SAIL memos.
Osborne did not feel comfortable signing the contract for the University
because rights for books & other printed materials reside with
faculty. This is essentially what he said several months ago.
He had talked with Clive Liston who said essentially the same thing.
I suggested a rewording of the contract that I think will be less
intimidating. Instead of the guarantee & warranty that you have
the rights to the reports and are giving Comtex the right to reprint
the microfiche form, the new contract will say something to the effect
that you represent the authors, and without guarantee & w. you
are turning over the reports to Comtex.
Comtex needs some document in hand before they can turn over royalties.
This one is being drafted now (their lawyers may still screw it up),
but it sounds like it will be something you can sign. I'll sign for
the HPP reports one of these days and it doesn't bother me. Our
best protection seems to reside in the facts that
(a) The CSD has been distributing these reports widely for many years;
(b) The royalties are not going to an individual.
I think Comtex is doing the AI community a favor by making these
reports available. Our own library has a hard time keeping technical
reports (especially from MIT) in stock, for example. So I keep
encouraging them to find wordings in contracts that are mutually
satisfactory.
bgb
-------
∂01-Feb-84 1245 AAAI-OFFICE@SUMEX-AIM.ARPA next lunch
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 1 Feb 84 12:45:15 PST
Date: Wed 1 Feb 84 12:49:11-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: next lunch
To: JMC@SU-AI.ARPA, genesereth@SUMEX-AIM.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
The location of our next luncheon meeting (incl Richard Manuck) will
Theo's, 521 University Ave, 1:15p.m. on Tuesday, Feb.7.
Claudia
-------
∂01-Feb-84 1340 mccarty%ucbdali@Berkeley Re: knowledge seminar
Received: from SU-HNV by SU-AI with TCP/SMTP; 1 Feb 84 13:39:59 PST
Received: from UCB-VAX.ARPA by Diablo with TCP; Wed, 1 Feb 84 13:15:14 pst
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.22/4.21)
id AA07613; Wed, 1 Feb 84 13:16:42 pst
Received: by ucbdali.ARPA (4.22/4.18)
id AA14886; Wed, 1 Feb 84 13:17:02 pst
Date: Wed, 1 Feb 84 13:17:02 pst
From: mccarty%ucbdali@Berkeley (Perry McCarty)
Message-Id: <8402012117.AA14886@ucbdali.ARPA>
To: HALPERN.IBM-SJ@Rand-Relay, KNOWLEDGE@SU-HNV
Subject: Re: knowledge seminar
I prefer the afternoon time slot, as I would like to be able
to attend the Stanford SIGLUNCH talk also. I would be happy
to attend morning talks instead if they were scheduled early
enough to not conflict with SIGLUNCH.
- Perry -
∂01-Feb-84 1406 TAJNAI@SU-SCORE.ARPA Forum reply
Received: from SU-SCORE by SU-AI with TCP/SMTP; 1 Feb 84 14:06:47 PST
Date: Wed 1 Feb 84 14:01:51-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Forum reply
To: jmc@SU-SCORE.ARPA
John, what meals do you plan to attend at the Forum meeting?
buffet supper Tues. night faculty club
lunch Wed.
banquet WEd. night SRI
lunch Thurs.
Carolyn
-------
∂01-Feb-84 1830 MULLER@SU-SCORE.ARPA CS258 - EKL - sublis.
Received: from SU-SCORE by SU-AI with TCP/SMTP; 1 Feb 84 18:30:28 PST
Date: Wed 1 Feb 84 18:29:10-PST
From: Eric Muller <MULLER@SU-SCORE.ARPA>
Subject: CS258 - EKL - sublis.
To: jk@SU-AI.ARPA
cc: jmc@SU-AI.ARPA
Hi.
I have tried to do the proof of the sublis/match problem using EKL
(this is an assignment in CS258), but I have some troubles to define
the sublis function (and it is much simpler than match !...).
The file match.sav[1,EXM] contains the source of my attempts, while
the file match.lsp[1,EXM] also contains the answers of EKL. Could you
please tell me what is wrong (from EKL and/or from me) ?
Thanks.
Eric Muller.
-------
∂01-Feb-84 1844 AAAI-OFFICE@SUMEX-AIM.ARPA UT hassles
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 1 Feb 84 18:44:45 PST
Date: Wed 1 Feb 84 18:48:43-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: UT hassles
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
This morning I received a call from Clifford Norton,director of
Performing Arts Center. He said no one from UT informed him of the
size of our conference or the nature of its operation, and did we
know that as an outside organizwtion we are required to sign a
contract.
This contract stipulates that an audit will be performed after
the conference and any surplus funds will be returned to UT.
He is sending me a copy of the contract and the profit/loss
statement which, I assume, is the audit form. I asked him
if we could apply a certain percentage of our operating expenses
to the p/l statement and he said yes. I also told him our UT
contact, Dean Heller, never informed me that we'd have to
sign this contract, and this fact was a real suprise to us at this
late date. IF we knew this fact a year ago, we would have chosen another site.
After this shock, I called Thompson Conference Ctr (location for
the tutorials) to see if that policy applied to the operation of the
tutorial program - no, it doesn't. Thank god! However, if we use any
rooms in the Perfoming Arts Center for tutorials, those revenues are
included in the overall p/l statement. So, I advised we don't have any
tutorials in the PAC. Now that I don't trust UT support staff to
convey accurate information or at least some basic facts, I've begun
to call hotels to see if we can hold the tutorials in their meeting
rooms. No answer yet.
I talked to Richard Fikes, and it's not clear how much
money we might have to return to the hordes at UT yet.
Some unknowns (ie UT services -electicians,technicians) are
difficult to determine. We could possibly return from $10-50k
or more (and this was the year, I had developed ways to save
money for the preparation and operation of the conference!)
It's to our advantage now to spend more so that we don't
have to give to UT.
I talked to Don and Ron, and both want to move the entire show
out of Texas. My only reservation is that it may very difficult
to find another site at this late date.
Feeling disgusted,
Claudia
-------
Claudia,
I phoned Woody who will see what the top administration of
the University can do. You should expect a call from him, because as
long as he is going to the top, he might as well know the complete
set of problems including those we had earlier decided to live with.
The attitude of the top administration toward computer science is such
that I'm sure they'll try to solve it.
John
∂02-Feb-84 0802 AAAI-OFFICE@SUMEX-AIM.ARPA
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 2 Feb 84 08:02:51 PST
Date: Thu 2 Feb 84 08:03:55-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 1 Feb 84 19:11:00-PST
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Thanks for the help!
Claudia
-------
∂02-Feb-84 1332 JK proposal
To: "@SATO.DIS[1,CLT]"
The format of the proposal includes a section titled "Information on Previous
Professional Visits to Japan".
Those of you who have been there, please speak up and send me a short
paragraph of your activities there via SAIL.
∂02-Feb-84 1418 SJG
Dear John -
Thanks for your note. Yes, that is the sort of thing I would like to
do. Yes, I have thought (I think) about the difficulty you describe;
that is probably why I haven't starting writing code for any "small"
projects yet - I am making progress in understanding these sorts of
problems (I think), and want to sort out just what I am trying to do
before I start doing any of it. (I guess I'm looking for a paradigm,
of sorts).
What I have done is taken the note I gave you before Christmas and
expanded it to deal with some of these issues (you will be sorry to
hear); then I learned TeX and put it into that. If it's suitable
(even though I know you disagree with its probabilistic philosophy on
a basic level), what are my chance of publishing it?
My view, for what it's worth, is this: Knowledge acquisition (the problem
to which you refer in your message) consists of a variety of different
things. To paraphrase Bruner, there is the problem of concept acquisition
(birds can fly), and that of concept formation (just what is a bird,
anyway?). I think that concept acquisition is a statistical matter, and
is far and away the easier (and less interesting) of the two problems.
As for formation, the answer is usually linguistic, I think - we know
that there is some notion "bird" because we hear it mentioned, and then
go off and find out just what a bird is (by asking, if need be). There is
also "spontaneous" concept formation, which is harder still, and I do have
some half-baked ideas on this...
Let me finish finding the typos in my "article", and I'll inflict you
with a copy.
Matt
∂02-Feb-84 1520 JK proposal
To: "@SATO.DIS[1,CLT]"
Sato.tex[doc,jk] represents a rough draft of the proposal in its
current shape. Please mail me comments, corrections and ideas.
Yasuko has agreed to TEX it. I would like to move onto the
TEX/hardcopy stage next week so that we can send a preliminary
draft to Sato for his comments as soon as possible.
∂02-Feb-84 1659 DFH Messages
Raj Reddy re: trip. 412-578-2597
Richard Jeanks. Computer Algebra Conference. 914 945-1233
∂02-Feb-84 2001 CLT*
please put out the seltezer bottles - delivery is tomorrow
∂03-Feb-84 0821 DKANERVA@SRI-AI.ARPA Lectures on Formalization of Commonsense Knowledge
Received: from SRI-AI by SU-AI with TCP/SMTP; 3 Feb 84 08:21:01 PST
Date: Fri 3 Feb 84 08:18:16-PST
From: DKANERVA@SRI-AI.ARPA
Subject: Lectures on Formalization of Commonsense Knowledge
To: jmc@SU-AI.ARPA
Have you been able to set a schedule for the remaining lectures
in your series? Will you be speaking at 3 today? You may have
announced this and I have just not seen it, but I would like
to include a schedule in next week's Newsletter and perhaps
circulate the information even earlier if it's available.
Thanks. -- Dianne
-------
My last lecture co-incided with a philosophy colloquium, and I want to
avoid this conflict. I would be grateful if you would announce my next
lecture, the one on non-monotonic reasoning and circumscription for the
next Friday that does not conflict with this colloquium. Please repeat
the fact that it is one of four and repeat the abstract for this lecture.
Thanks for reminding me.
∂03-Feb-84 1055 DKANERVA@SRI-AI.ARPA
Received: from SRI-AI by SU-AI with TCP/SMTP; 3 Feb 84 10:55:47 PST
Date: Fri 3 Feb 84 10:55:56-PST
From: DKANERVA@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Fri 3 Feb 84 10:11:00-PST
There would be no philosophy colloquium today, but it is too
short notice to gather people for your lecture. The Fridays on
which philosophy colloquia are scheduled are Feb. 10, Feb. 24,
March 16, April 13, and most of the Fridays in May.
So the next Fridays that do not coincide with philosophy
colloquia are:
February 17
March 2
March 9
March 23
March 30
etc.
I'll announce your next lecture for February 17, with the last
two on March 2 and 9, if those dates are available for you.
-- Dianne
-------
Your proposed dates will be fine. Please make sure about the room.
∂03-Feb-84 1102 RINDFLEISCH@SUMEX-AIM.ARPA Symbolics Memory
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 3 Feb 84 11:02:34 PST
Date: Fri 3 Feb 84 11:01:01-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Symbolics Memory
To: Pattermann@SUMEX-AIM.ARPA, Yeager@SUMEX-AIM.ARPA, Schmidt@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, Grinberg@SUMEX-AIM.ARPA, Brown@SUMEX-AIM.ARPA,
Foyster@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, RPG@SU-AI.ARPA, TOB@SU-AI.ARPA,
ROD@SU-AI.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA
Dave Schlager just called from the Symbolics sales meeting in Vermont.
Among other things, the $14K price for 2 MByte memory increments will
come down to $9,900 for orders before 3/15/84 and then back up to $11K
for orders after 3/15. This gimick is apparently to try to generate
some orders to impress investors... Schlager is also trying to get
approval for us to buy 3600's with the DARPA configuration (4 MB memory
and 400 MB disk) at the $86K DARPA price without having to go through
ISI. No word on how that is going.
At the $10K "bargain", the net cost of our machines would be $78K if
we upgraded to 4 MB. How many are feeling the memory pinch already?
Tom R.
-------
∂03-Feb-84 1103 DKANERVA@SRI-AI.ARPA
Received: from SRI-AI by SU-AI with TCP/SMTP; 3 Feb 84 11:03:30 PST
Date: Fri 3 Feb 84 11:04:30-PST
From: DKANERVA@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Fri 3 Feb 84 10:59:00-PST
Right--I'll confirm the room. Thanks. -- Dianne
-------
∂03-Feb-84 1124 DKANERVA@SRI-AI.ARPA McCarthy Lectures on the Formalization of Commonsense Knowledge
Received: from SRI-AI by SU-AI with TCP/SMTP; 3 Feb 84 11:23:55 PST
Date: Fri 3 Feb 84 11:23:57-PST
From: DKANERVA@SRI-AI.ARPA
Subject: McCarthy Lectures on the Formalization of Commonsense Knowledge
To: csli-friends@SRI-AI.ARPA
cc: jmc@SU-AI.ARPA
John McCarthy will give the remaining three lectures of his
series on the formalization of commonsense knowledge on the dates
given below. These lectures will be held at 3:00 p.m. on each
of those Fridays at the Ventura Hall Conference Room, Stanford
campus.
February 17 "The Circumscription Mode of Nonmonotonic Reasoning"
Applications of circumscription to formalizing commonsense facts.
Applicatio to the frame problem, the qualification problem, and
to the STRIPS assumption.
March 2 "Formalization of Knowledge and Belief"
Modal and first-order formalisms. Formalisms in which possible
worlds are explicit objects. Concepts and propositions as
objects in theories.
March 9 "Philosophical Conclusions Arising from AI Work"
Approximate theories, second-order definitions of concepts,
ascription of mental qualities to machines.
-------
∂03-Feb-84 1234 PACK@SU-SCORE.ARPA New prolog program
Received: from SU-SCORE by SU-AI with TCP/SMTP; 3 Feb 84 12:33:50 PST
Date: Fri 3 Feb 84 12:33:09-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: New prolog program
To: jmc@SU-AI.ARPA
I finally have a working version of my tower-building program. It is
more a program than a statement of the problem in logic, but I think
it does the right thing. Currently it only stacks blocks -- I hope to
add painting to it, too. A copy of it is on plan.pl[1,LEP].
-------
∂03-Feb-84 1300 JMC*
List of Stark papers to Fagin.
∂03-Feb-84 1321 BSCOTT@SU-SCORE.ARPA ARPA funds
Received: from SU-SCORE by SU-AI with TCP/SMTP; 3 Feb 84 13:21:20 PST
Date: Fri 3 Feb 84 13:20:30-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: ARPA funds
To: JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, DCL@SU-AI.ARPA, ZM@SU-AI.ARPA,
Wiederhold@SUMEX-AIM.ARPA
cc: DFH@SU-AI.ARPA, MAS@SU-AI.ARPA, RBA@SU-AI.ARPA, Atkinson@SU-SCORE.ARPA,
BScott@SU-SCORE.ARPA
We still have no official word that the old contract has been extended. How-
ever, I have just guaranteed total expenditures (total for all five accounts)
not to exceed $200K. So at least you can continue to pay salaries and the
bare necessities until we get the modification and the extension.
I'll let you all know just as soon as I have some news.
Betty
-------
∂03-Feb-84 1405 AAAI-OFFICE@SUMEX-AIM.ARPA FYI
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 3 Feb 84 14:05:20 PST
Date: Fri 3 Feb 84 14:05:24-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: FYI
To: JMC@SU-AI.ARPA, Walker@SRI-AI.ARPA, fikes%usc-ecld@USC-ECL.ARPA,
Brachman@SRI-KL.ARPA, Lenat@SU-SCORE.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Woody is meeting with the VPs of Academic Research and Finance, an
Associate Dean and UT's legal staff on Monday. The VP of Research
and the Associate Dean of Natural Sciences are eager to settle
the surplus issue and feel that they will find a solution to this
situation.
Claudia
-------
∂03-Feb-84 2123 SCHREIBER@SU-SCORE.ARPA ai section of comp
Received: from SU-SCORE by SU-AI with TCP/SMTP; 3 Feb 84 21:22:51 PST
Date: Fri 3 Feb 84 17:36:06-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: ai section of comp
To: jmc@SU-AI.ARPA
cc: lamping@SU-SCORE.ARPA
Let me ask you an important question. You may know that some of the PhD
students dislike having to read the AI Handbook in order to prepare for the
comprehensive. The last committee's active member in AI, Jitta Malik, has
proposed that the Handbook be deleted from the list and replaced by the new
edition of Winston's book. Of course, this change has to be approved by the
faculty and will not take effect until next years exams if it is so approved.
You could, however, commit yourselves now to giving an exam that tests only
that knowledge that can be had by reading either the Handbook (only the
sections on the list, naturally) and Winston. You could also allow us to
inform the students of this.
Do you want to so commit yourselves and do you want the students to be
so informed?
Rob
-------
It has always been my goal to have exactly one reference.
∂03-Feb-84 2134 LLW@S1-A Thanks
Received: from S1-A by SU-AI with TCP/SMTP; 3 Feb 84 21:34:02 PST
Date: 03 Feb 84 1833 PST
From: Lowell Wood <LLW@S1-A>
Subject: Thanks
To: jmc@SU-AI
CC: LLW@S1-A
∂31-Jan-84 0102 JMC@SU-AI Star Wars Message
Received: from SU-AI by S1-A with TCP/SMTP; 31 Jan 84 01:02:05 PST
Date: 31 Jan 84 0059 PST
From: John McCarthy <JMC@SU-AI>
Subject: Star Wars Message
To: llw@S1-A
∂30-Jan-84 SIEGMAN@SU-SIERRA.ARPA 31-Jan-84 JMC Star Wars Message
Received: from SU-SIERRA by SU-AI with TCP/SMTP; 30 Jan 84 23:28:52 PST
Date: Mon 30 Jan 84 23:29:41-PST
From: Tony Siegman <SIEGMAN@SU-SIERRA.ARPA>
Subject: Star Wars Message
To: su-bboards@SU-SIERRA.ARPA
I'm acquainted with one or two of the scientists -- and Stanford
students -- mentioned in the chilling star wars news item just
reprinted here by John McCarthy.
God save us all from their insane technological hubris.
-------
jmc - Siegman's message is another attempt at proof by intellectual
intimidation. Kindly explain slowly and carefully your contention
that the Livermore people are insane. Explain how you can be sure.
The mere fact that this bullying line is taken by lots of authorities
will not suffice.
[JMC - Forwarded to OTHER-SU-BBOARDS from line 15]
[John: In this era of ultra-complete disclosure, one might have expected
Siegman to have stated that he had met *precisely* one of the
`scientists--and Stanford students' in `O' Group, that he and this person
had parted on poor terms five years ago, and that they hadn't seen each
other since. In any event, thanks for your eminently reasonable
remarks--they're as refreshing as they are rare (the greater pity, as one
might hope that the Stanford community would be a haven for rational
discourse--at least on really serious problems--rather than the bedlum of
emotion and politics-by-gibbering-invective that it so often appears to
be). Lowell]
∂03-Feb-84 2249 reid@Glacier cmu-cs-c
Received: from SU-GLACIER by SU-AI with TCP/SMTP; 3 Feb 84 22:49:18 PST
Date: Friday, 3 February 1984 17:05:30-PST
From: Brian Reid <reid@Glacier>
Subject: cmu-cs-c
To: jmc@Sail
When I was at CMU they had only 10's, not 20's, and as far as I know
their 20's run Mark Crispin's FINGER software.
The disambiguation algorithm used on the 10's is to use spaces:
Dana Scott@CMU-CS-C
if your system cannot handle the space, a period works just as well:
Dana.Scott@CMU-CS-C
∂03-Feb-84 2249 reid@Glacier p.s. re: CMU system
Received: from SU-GLACIER by SU-AI with TCP/SMTP; 3 Feb 84 22:49:27 PST
Date: Friday, 3 February 1984 17:05:55-PST
From: Brian Reid <reid@Glacier>
Subject: p.s. re: CMU system
To: JMC@Sail
Send any complaints to user GRIPE on the affected machine: GRIPE@CMU-CS-C
∂04-Feb-84 1924 reid@Glacier recent bboard posting re: defense
Received: from SU-GLACIER by SU-AI with TCP/SMTP; 4 Feb 84 19:24:10 PST
Date: Saturday, 4 February 1984 19:22:57-PST
From: Brian Reid <reid@Glacier>
Subject: recent bboard posting re: defense
To: JMC@Sail
Very well done. Would that all participants in this argument were so careful.
∂05-Feb-84 1038 CLT
done
∂06-Feb-84 1412 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay knowledge seminar
Received: from SU-HNV by SU-AI with TCP/SMTP; 6 Feb 84 14:12:35 PST
Received: from rand-relay.ARPA by Diablo with TCP; Mon, 6 Feb 84 14:08:18 pst
Date: 6 Feb 1984 10:47:15-PST (Monday)
From: Joe Halpern <HALPERN.IBM-SJ@Rand-Relay>
Return-Path: <HALPERN.SJRLVM1.IBM-SJ@Rand-Relay>
Subject: knowledge seminar
To: KNOWLEDGE@SU-HNV
Cc: konrad.ucsc@Rand-Relay
Via: IBM-SJ; 6 Feb 84 13:16-PST
By an overwhelming 8-2 vote, the preference seems to be for morning
seminars rather than afternoon seminars. The next knowledge seminar
will thus be on Feb. 10, at 10 AM, again in the main auditorium of
Building 28 at IBM. There will be two talks, one by Ron Fagin, and
one by Joe Halpern. I suspect we'll be done before noon (the second
talk should only last about 40 minutes). I have booked a small
cafeteria for lunch at IBM, for those who want to stay and discuss
some of the issues brought up by the speakers. The following knowledge
seminar will again be at 10 AM on Feb. 24. The speakers will be
Kurt Konolige of SRI and Yoram Moses of Stanford University.
On Mar. 9, our speakers will be Bob Moore of SRI, and Hector Levesque
of Fairchild. I'm open for suggestions for future talks.
Here are the abstracts for next Friday's talks:
On the semantics of updates in databases -- Ron Fagin
A database can be viewed as representing some knowledge about the world.
What happens to the state of knowledge when you try to update the
database? We show the kinds of problems that can arise in such
situations, and give techniques for dealing with
the insertion or deletion of arbitrary facts
(not just "single tuples") into a database.
Our techniques give insight into the problems of updating
views and of dealing with incomplete information.
The talk will be completely self-contained.
A beginner's guide to the modal logic of knowledge - Joe Halpern
We will give an overview of the techniques used to model knowledge
by means of modal logic and Kripke structures. In particular, we
show how changes in the axioms of knowledge are reflected in
the "alternate worlds" relation. We concude with some discussion of
the advantages and shortcomings of Kripke models. As the title suggests,
the talk will be introductory and self-contained, and is to some extent
preparation for future talks which will use modal logic.
∂06-Feb-84 1446 avg@diablo Re JMC on USSR
Received: from SU-HNV by SU-AI with TCP/SMTP; 6 Feb 84 14:46:01 PST
Date: Mon, 6 Feb 84 14:45 PST
From: Allen VanGelder <avg@diablo>
Subject: Re JMC on USSR
To: su-bboards@Diablo
Cc: jmc@sail
Question to JMC:
If Russia's military complex is usurping an ever increasing share of
their GNP (a clumsy paraphrase, but refer to original bboard message for
exact statement by JMC), and that is bad for the US, should we not
discontinue selling them food, in order to force them to divert more
national effort into feeding themselves?
If relative military strength were the sole consideration, this might
be so, but we aren't at war with them, and the game isn't zero sum.
Therefore, trade and some two-way sharing of science and technology
is beneficial to us as well as to both the Soviet people and the Soviet
Government. I'm not sending this to bboard now, because I intend to
reply at length to JMM after adequate thought.
∂06-Feb-84 1836 SCHREIBER@SU-SCORE.ARPA Welcome to the committee.
Received: from SU-SCORE by SU-AI with TCP/SMTP; 6 Feb 84 18:36:46 PST
Date: Mon 6 Feb 84 18:35:58-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Welcome to the committee.
To: schreiber@SU-SCORE.ARPA, dek@SU-AI.ARPA, foulser@SU-SCORE.ARPA,
abadi@SU-SCORE.ARPA, papa@SU-SCORE.ARPA, wilson@SU-SCORE.ARPA,
tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA, lantz@SU-SHASTA.ARPA,
stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA, lamping@SU-SCORE.ARPA,
jmc@SU-AI.ARPA
Welcome all of you to the Spring comprehensive exam committee.
Following the pioneering work of Don Knuth, I hope to get the (large) job
done well, with a minimum of wasted effort. So we will have only 4 committee
meetings. These are tentatively scheduled for
March 20
April 10
May 22
June 5
at 12:30 (these are all Tuesdays).
Please mark your calendars.
And please send me a message acknowledging that you got this message; tell
me if you absolutely cannot come to the a committee meeting.
I will be sending another message soon, with a detailed plan for making
up the exam. For now, let me thank you all for volunteering.
Rob Schreiber
-------
∂06-Feb-84 1840 RPG
(declare (special foonum)(fixnum foonum))
(setq foonum 0)
(defun foonum-gentag ()
(implode (append '(f o o -)
(exploden (setq foonum (+ foonum 1))))))
∂06-Feb-84 1854 RPG
(find-parts 'ab34)
∂06-Feb-84 1901 RPG
∂06-Feb-84 2008 RPG AAAI
I mentioned to Brachman via netmail that AAAI ought to have a followup
this year on my performance stuff, this time with results. He never responded.
Could you bring it up with him? Thanks.
-rpg-
Please explain more about what you want and why I (of all people) should
take it up with Brachman. I haven't interacted directly with him about
AAAI conference. Why isn't for the Lisp conference anyway, of which Boyer
is boss?
∂07-Feb-84 1016 AAAI-OFFICE@SUMEX-AIM.ARPA update
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 7 Feb 84 10:16:12 PST
Date: Tue 7 Feb 84 10:14:39-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: update
To: Fikes%usc-ecld@USC-ECL.ARPA, JMC@SU-AI.ARPA, Bledsoe@UTEXAS-20.ARPA,
Walker@SRI-AI.ARPA, Brachman@SRI-KL.ARPA, Lenat@SU-SCORE.ARPA,
Rich@UTEXAS-20.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
I just finished talking to Dean Gleason, Assoc. Dean in UT's College of
Natural Sciences about the surplus funds issue. At this point, they have not
developed any concrete solutions but continues to assure me that they (the
Vice President of Academic Research and Gleason) want this conference
on campus. He even suggested they are quite willing to bend
UT's rules and regs for this particular conference. I told him our
association does not want to be any party to any subterfuge.
I will going to Austin next week and will meet with Gleason and another
Assoc Dean to develop some options. After that meeting, they hopefully
will prepare a letter which will outline our financial responsibilities
to UT. I don't know if this letter will take us off the hook yet; I've
got a call into our attorney to get her opinion.
Claudia
-------
Claudia, there is a distinction between UT bending their rules, which is
their business, and our doing something illegal, which we shouldn't, e.g.
certifying something grossly false.
∂07-Feb-84 1029 AAAI-OFFICE@SUMEX-AIM.ARPA
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 7 Feb 84 10:29:35 PST
Date: Tue 7 Feb 84 10:29:37-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Tue 7 Feb 84 10:21:00-PST
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Let me give you an example - they suggested to me that we do not report
our revenues from the exhibit booth sales and report a partial accounting
of our gross technical registration fees.
Claudia
-------
∂07-Feb-84 1617 JMC
dennett cognitive wheels
∂07-Feb-84 2123 SJG
Sorry, John. It looks sufficiently like the last rev I thought I didn't
need to autograph it. (e.g., Analyzing Incomplete Information is mine.)
Matt
∂08-Feb-84 1401 JMC*
Hirsh exam, haym@score
∂08-Feb-84 1423 MA Y
Yes, there is something about your question in Stoy. See p.77.
Martin
∂08-Feb-84 2151 GOLUB@SU-SCORE.ARPA industrial profs
Received: from SU-SCORE by SU-AI with TCP/SMTP; 8 Feb 84 21:51:22 PST
Date: Wed 8 Feb 84 14:26:28-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: industrial profs
To: jmc@SU-AI.ARPA
Have you sent out ads for industrial professors? I'd like to have someone apply
( or is it good enough to nominate him ? )
GENE
-------
∂08-Feb-84 2233 SCHREIBER@SU-SCORE.ARPA Spring Comprehensive: Hello!
Received: from SU-SCORE by SU-AI with TCP/SMTP; 8 Feb 84 22:32:58 PST
Date: Wed 8 Feb 84 16:30:23-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Spring Comprehensive: Hello!
To: schreiber@SU-SCORE.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, abadi@SU-SCORE.ARPA, papa@SU-SCORE.ARPA,
wilson@SU-SCORE.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA
cc: mwalker@SU-SCORE.ARPA, golub@SU-SCORE.ARPA
Welcome to the comp committee! I will do my best to make the time you put
into our joint work worthwhile. And to make the job less onerous,
I've divided our committee into two parts; another subcommittee is
going to take care of the programming projects, while the rest of us
are charged only with making up and administering the exam, and revising
the reading list for the spring comp.
Our subcommittee is, in turn, parceled up into six parts having primary
responsibility for the six sections of the exam.
NA: Rob Schreiber, Billy Wilson % Numerical Analysis
AI: John McCarthy, John Lamping % Artificial Intelligence
SW: Keith Lantz, Per Bothner, Tracy Larrabee % Software
AA: Don Knuth, Dave Foulser % Analysis of Algorithms
HW: Manolis Katevenis, Stefan Demetrescu % Hardware
MTC: Christos Papadimitriou, Martin Abadi % Math Theory of Computation
Of course, we'll all work together on the exam as a whole.
I have appended to this note a copy of the reading list the students have
received, and the famous "charge" to our committee. I suggest that you get
from Marilynn Walker the copies of the last two exams, since we will be
making a similar one (namely, six one-hour exams, one for each area,
closed book).
At the moment there is only one piece of urgent business: Everybody who will
take the comp wants to know when it will be given. I believe it is best to
give it at approximately half-year intervals, hence I propose choosing the
latest possible date in May. (The winter comp was given January 14 and 15).
What do you think about the following exam dates?
Saturday, May 19, am: SW, AA, NA.
Sunday, May 20, pm: HW, MTC, AI.
If I hear no strong objections by next Friday (Feb 17), I'll announce
these officially. As last year, we will make exceptions in exceptional
cases (e.g., if somebody needs to take it a day earlier or later for
religious reasons).
I am arranging for some students to pre-take the exam.
In addition, each subcommittee should try to find one student to
pre-test their section.
At the moment I favor the following approach: Each of the six
subcommittees gets together on
their own to come up with possible exam questions. Then I meet with each
of the six subcommittees to help refine the questions, after which I'll present
Phyllis with an edited draft of each question. Then the whole committee
will look at these drafts, and refine everything as a group. Then
the guinea-pigs take our trial exam. Then we grade his work and make
appropriate refinements. Then we administer the real exam.
If you agree with the suggested strategy, I propose the following rough timetable:
Now -- Mar. 12: Six small subcommittees get together and make rough drafts.
Mar. 12 -- Mar. 16: Each subcomittee meets with me to make less rough draft.
Tuesday Mar 20, 12:30: Whole committee refines it (expect a 3.75-hour meeting)
Sometime during the rest of November: Student guinea pigs take it
Tuesday April 10, 12:30: We finalize the exam (another meeting)
*******************************************************
What should you do now? Please send me a note, so that I know you have
received this message. In your note, tell me if you cannot come to Tuesday
meetings from 12:30--4:00 (there will be 2 before and 2 after the exam)
And DO please meet with the other member(s) of your subcommittee, before
March 12, so that you'll be ready with a rough draft when Shanee
calls you to set up appointments with me during the week of March 12.
*******************************************************
Thanks again for your willingness to serve on this committee. I think we
can make a creative experience out of it. Two appendices follow:
------------------------ Current Reading List (old TeX format) ---------------------
\input basic
\font A=cmtitl % font for title
%\output{\page}
%\vsize 9truein \hsize 6.5truein
\parindent 0pt
\parskip 10pt plus 3pt minus 3pt
\def\pskip{\vskip 20pt plus 6pt minus 6pt}
\def\area#1{\par\penalty-200\pskip\hbox{\qquad #1}\penalty1000}
\ctrline{\:A Comprehensive Examination Reading List}
\ctrline{(Revised June 7, 1983)}
\area{ALGORITHMS AND DATA STRUCTURES}
Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman, {\sl Data
Structures and Algorithms}, Addison-Wesley, 1983.
Michael R. Garey and David S. Johnson, {\sl Computers and Intractability},
Freeman, 1979, Chapters 1--3.
Donald E. Knuth, {\sl The Art of Computer Programming}, Volume 1, Second
Edition, Addison-Wesley, 1973, Section 1.2 (except for Subsections
1.2.9, 1.2.10, 1.2.11.2, and 1.2.11.3).
\area{ARTIFICIAL INTELLIGENCE}
Avron Barr and Edward A. Feigenbaum (eds.), {\sl Handbook of Artificial
Intelligence}, Volume 1, Kaufmann, Stanford, 1981.
Avron Barr and Edward A. Feigenbaum (eds.), {\sl Handbook of Artificial
Intelligence}, Volume 2, Kaufmann, Stanford, 1982.
Paul R. Cohen and Edward A. Feigenbaum (eds.), {\sl Handbook of Artificial
Intelligence}, Volume 3, Kaufmann, Stanford, 1982.
$$
\hbox{Only the following sections of the above three volumes:}\atop
\vbox{\halign{\lft{#}\quad&\lft{#}\qquad&\lft{#}\quad&\lft{#}\cr
I: &A, B, C &IX: &A, B\cr
II: &A, B, C, D &X: &A, B, C, D1\cr
III: &A, B, C &XI: &A, B, C\cr
IV: &A, B, C, D, F &XII: &A, B, C, E\cr
V: &A, B, C1, C2 &XIII: &A, B4, B5, C4, D1, D2, D3, D5, D6, E4, F\cr
VI: &A, B, C1, C2, C3, C4, D &XIV: &A, D1, D3a, D4, D5, D5d\cr
VII: &A, B, C, D1, D3 &XV: &A, B, C, D, E\cr
VIII: &A, B1, B2, B3\cr
}}$$
\area{HARDWARE SYSTEMS}
M. Morris Mano, {\sl Computer System Architecture}, Second Edition,
Prentice-Hall, 1982.
John F. Wakerly, {\sl Microcomputer Architecture and Programming},
Wiley, 1981 (except Chapters 14--19).
\area{NUMERICAL ANALYSIS}
Kendall E. Atkinson, {\sl An Introduction to Numerical Analysis}, Wiley,
1978, Chapters 1--3, 5, 7, 8 (except Sections 2.8, 2.10, 5.4).
\area{SOFTWARE SYSTEMS}
Alfred V. Aho, and Jeffrey D. Ullman, {\sl Principles of Compiler Design},
Addison-Wesley, 1977. All except Chapters 12--14.
Terrence W. Pratt, {\sl Programming Languages: Design and Implementation},
Prentice-Hall, 1974.
James L. Peterson and Abraham Silberschatz, {\sl Operating System Concepts},
Addison-Wesley, 1983, Chapters 1--9.
\area{THEORY OF COMPUTATION}
John E. Hopcroft and Jeffrey D. Ullman, {\sl Introduction to Automata
Theory, Languages, and Computation}, Addison-Wesley, 1979, Chapters
1--3, 4.1--4.6, 5--7, 8.1--8.5.
Zohar Manna, {\sl Introduction to Mathematical Theory of Computation},
McGraw-Hill, 1973, Chapters 1--3.
John McCarthy and Carolyn Talcott, {\sl LISP: Programming and Proving},
(available from McCarthy's secretary) 1980, Chapters 1--3.
Elliott Mendelson, {\sl Introduction to Mathematical Logic}, Van
Nostrand, 1964, Chapters 1--2; alternatively, Herbert B. Enderton,
{\sl A Mathematical Introduction to Logic}, Academic Press, 1972,
Chapters 1--2.
\par\pskip
\area{PREPARATION}
The document ``Charge to the Comprehensive Exam Committee,'' available from the
department office, describes general policy. Previous exams, also available
from the department office, provide a good source from which to study.
The comprehensive exam is meant generally to cover the material from
the followiwng courses: 155, 161, 162 (algorithms and data
structures); 223 [224 is recommended in addition] (artificial
intelligence); 111, 112, 311 (hardware systems); 137A (numerical
analysis); 142, 143, 146 [246 is recommended in addition] (software
systems); and 154, 156 [206 is recommended in addition] (theory of
computation). Since the precise content of these courses varies, the
actual scope of the exam will be determined by the references above.
The exam will also assume a certain mathematical sophistication and a knowledge
of programming. Proofs of correctness for simple programs may be required.
The programming knowledge required will be Pascal, LISP, and an assembly
language. Nonsmoking and smoking examination rooms will be scheduled.
\area{PROGRAMMING PROJECT}
Students in the M.S. and Ph.D. programs (and Ph.D. Minor students who
have passed the written examination) must prepare a programming
project of sufficient complexity and quality to demonstrate competence
in computer programming. This project must be supervised and endorsed
by a member of the Computer Science Department faculty and submitted
to the comp committee for final approval. The project must be written
at Stanford by the student, working independently. It is due,
approved and signed by the supervising faculty member and given to the
Administrative Assistant for Academic Affairs, before the end of the
student's second year, specifically before the middle of spring
quarter.
The project must exhibit the use of sophisticated algorithms and data
structures and be well documented. Programs will be judged on the
basis of correctness, efficiency, clarity, and style. The project may
be the result of CS 293 work, although it need not be. It should
represent at least 3 units of work. Before starting the project, read
the ``Requirements for the Comprehensive Programming Project''
available from the department office.
Some matters of style are discussed in
$$\halign{\qquad#\hfill\cr
O.-J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, {\sl Structured Programming},
Academic Press, 1972.\cr
\cr
Brian W. Kernighan and P. J. Plauger, {\sl The Elements of Programming Style},
McGraw-Hill, 1974.\cr}$$
\par
Good luck.
(This document is filed as <CS.STUDENT>COMPSYLLABUS.TEX; older
versions of it are filed as <CS.STUDENT>COMPSYLyy.TEX, where yy is the
year)
\end
------------------------ Current "Charge" (Scribe format) --------------------------
@Comment[Updated as per faculty meeting 7-June-83
Previous revisions:
Updated 8/10/82---MEW (Per Faculty Meeting 6/8/82)
Updated 5/27/82---ARK
Taken from online version of Denny's file from 12/29/80
]
@make(Memo, Phone "497-2273", Department CSD, Logo Old,
Who "82-83 comp committee")
@to(CSD students, faculty, and future comp committees)
@from(82-83 comp committee)
@subject(Charge to the Comprehensive Exam Committee)
@Begin(Body)
This is an edited version of the Charge to the Comprehensive Exam
Committee drafted in November, 1978 by Denny Brown. Older versions
may be found as indicated at the end of this memo.
During 1978 and 1979, students expressed dissatisfaction with some
aspects of the comprehensive exam. In response to some of the issues
raised, an ad hoc committee composed of Jeff Barth, Frances Yao, Terry
Winograd, and Al Spector was created in Spring, 1978. Their proposals
were presented at the June 1978 faculty meeting. In this memo I will
attempt to present a charge to the comp committee that incorporates
the new policies agreed upon at the June meeting with standard
operating procedures of previous comp committees. This is not
intended to be a definitive document; instead, it is my attempt to
bring together what I believe to be "current policy" concerning the
comprehensive exam.
Additional proposals were presented by the students at the June 12,
1979 faculty meeting. The text of these proposals are attached to the
June 12 faculty meeting minutes. The faculty passed a resolution at
the June 12 meeting. The resolution appears below.
The form of programming portion of the exam was modified at the June
10, 1980 faculty meeting. It was decided to do away with the five-day
programming problem. Instead, a student will submit a program to the
comp committee for approval. Text of the resolution appears below.
@Begin(Enumerate)
The comprehensive exam will be given in two independent parts, the
written exam and the programming project. Students must pass both
parts of the exam at the appropriate level. Grading of the two parts
will be independent of one another, so that a student may pass the
written exam at one time and the programming project at another (in
either order.) The comp committee will try to schedule the exams to
minimize conflicts with courses. The 1979 written exams were given on
Saturday, January 26, and Saturday, May 10. The 1983 written exams
were two-day exams with three one-hour sections on each day; they were
given on the Saturday-Sundays of January 8-9 and May 21-22. The
committee may revise the schedule. The dates should be decided upon
at the first committee meeting.
The comp committee will be composed of 6-10 faculty members and
research associates and 4-6 students who will serve for an entire
academic year. The terms of service will be staggered so that about
half of each committee will have served on the previous exam and about
half will be new members. The committee should be collectively
competent in the six areas of the exam, namely Algorithms and Data
Structures, Artificial Intelligence, Hardware Systems, Numerical
Analysis, Software Systems, and Theory of Computation. They will
administer two written exams and grade programming projects. They
will revise and publish a list of readings and suggested courses to be
used for the exams in the following year. They will prepare a charge
to the following year's committee reflecting additions or
modifications to this charge.
The comprehensive exam serves three purposes. It is (1) the principle
breadth requirement in the Ph.D. program. It is (2) the principle
"quality control" feature of the M.S. in Computer Science program. It
is (3) the only requirement for a Ph.D. minor in Computer Science.
The exam has traditionally been scored as follows:
@Begin(enumerate)
Ph.D. pass - student has a high total grade and has exhibited
acceptable competence in all six sections of the exam.
Conditional Ph.D. pass - student has a high total score, but is
deficient in one of the six sections. Explicit criteria for removal
of the deficiency are given including name of the person who will
certify satisfaction of the condition.
Masters pass - student's total score is sufficient for Masters or
Ph.D. minor accreditation. Breadth is not an issue for such a pass.
Fail - student's total score was unacceptable.
@end(Enumerate)
Exams are graded without knowledge of the students' identities.
Consequently, students in the M.S. program may pass at a "higher"
level. (This does not have any bearing on the student's admission to
the Ph.D. program. Admission is an entirely separate issue.)
Similarly, Ph.D. students may pass at the Masters level. (This would
enable the student to take the Masters degree.)
It is required that Ph.D. students pass the exam at the Ph.D. level
within the first two years of full-time study. Masters students often
plan to spend only one year in the Masters program. The reading list,
list of suggested courses, grading criteria, and the composition of
the exam itself should make it possible to pass the exam at the
Masters level after a single year here. Masters students have been
informed, however, that many students do not pass the exam in the
first year. There has been a tendency to increase the number of
courses recommended for the exam. Constraints upon the expected
length of programs should be kept in mind. At the January 18, 1980
faculty meeting, the faculty voted that Masters students be allowed
only four attempts to pass the exam. This is roughly in keeping with
the two-year limit for Ph.D. students. My (DPB) suggestion is to
limit the scope of potential questions to core issues in each area,
while continuing to require solid performance on the exam.
Don Knuth pointed out that the first exams were four-hours. The
expansion to six hours was a reasoned decision. The 78-79 committee
specifically stipulated that the exam should be a six-hour exam. This
should provide a choice of problems to work on in each section.
Nobody is expected to (come close to) finishing the entire exam.
Each question on the written exam should be graded by at least two
members of the committee; at least one reader should be a faculty
member. Grading of exams should be prompt (say within a week) so
that students can make appropriate plans based on the results of the
exam. The programming project should be graded by at least one member
of the committee but by someone other than the student's advisor.
At the June 1978 faculty meeting, there was a suggestion that a
separate committee administer the programming problem. For this year,
the committee may want to designate a subcommittee to handle the
programming problem. In the charge to the 79-80 committee a
recommendation as to whether the exam committee should be split into
two separate committees would be appreciated. No such recommendation
was given by the 78-79 committee, so we will assume that the entire
committee will be responsible for the programming problem.
@begin(Multiple)
The following motion was passed at the faculty
meeting of June 12, 1979.
@begin(Quotation)
If a Ph.D. student fails twice, or has only one chance left, the
Comprehensive Exam Committee is to arrange a meeting soon after the
exam with the student and his/her advisor to discuss a plan of action.
@end(Quotation)
The key argument leading to this motion was that the comp committee
has a great deal of assembled expertise on the issue of the student's
competence. They know what was expected on the exam, and they know
exactly how the student performed, both absolutely and in relation to
other students who took the exam. They are in the best position to
determine the cause of the student's failure, and to recommend
remedial action. Suggested courses of action include: (a) encourage
the student to study hard, paying special attention to weak areas, and
take the exam again at the next opportunity, (b) if the committee
believes that the student is more knowledgeable than was demonstrated
on the written exam, an alternative method for satisfying the
comprehensive requirement may be substituted for re-taking the written
exam. Examples (not exhaustive) of such alternatives are (i) an
immediate oral exam covering any area of the committee's choosing to
determine if the student's poor performance might have been caused by
poor test-taking skills, or (ii) alternative written work without the
exam's time pressure, or (iii) other reasonable requirements which the
committee, the student, and the student's advisor agree upon. In
general, the exam committee should consider that its task is not
limited to administering the written exam and programming project.
Included in the responsibility is that of diagnosing the cause for
failure of any Ph.D. student who is close to the end of the rope.
@begin(Quotation)
Note: The motion as passed explicitly mentions Ph.D. students who are
in danger. The committee may (or may not) want to consider Masters
students who may not perform well on timed-written exams. A similar
mechanism may be called for in such cases.
@end(Quotation)
@end(Multiple)
@begin(Multiple)
The following resolution, passed at the June 10, 1980 faculty meeting,
gives the new policy on the programming exam.
@begin(Quotation)
Students in the M.S. and Ph.D. programs (and Ph.D. minor students who
have passed the written examination) must prepare a programming
project of sufficient complexity and quality to demonstrate competence
in computer programming. This project must be supervised and endorsed
by a member of the Computer Science Department faculty and submitted
to the comp committee for final approval. The project must be written
after entering the program at Stanford by the student, working
independently.
The project must exhibit the use of sophisticated algorithms and data
structures and be well documented. Programs will be judged on the
basis of correctness, efficiency, clarity, and style. The project may
be the result of CS293 work, although it need not be. The project
should represent at least 3 units of work.
@end(Quotation)
The 1981 committees should decide on a mechanism for implementing this
policy.
@end(Multiple)
@end(Enumerate)
This document is filed as <CS.STUDENT>COMPCHARGE.MSS; older versions
of it are filed as <CS.STUDENT>COMPCHRGyy.MSS, where yy is the year.
This document was approved in its current form by the Computer Science
faculty on June 7, 1983.
@end(body)
-------
∂09-Feb-84 0706 CL.BOYER@UTEXAS-20.ARPA 3600 long lines
Received: from UTEXAS-20 by SU-AI with TCP/SMTP; 9 Feb 84 07:05:55 PST
Date: Thu 9 Feb 84 09:05:36-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: 3600 long lines
To: JMC@SU-AI.ARPA
cc: RPG@SU-AI.ARPA
When you were last here you noted with interest that we were
getting long lines between our 3600s and their consoles.
The lines have been installed and are working quite well.
The lines currently are 1000'.
-------
∂09-Feb-84 0936 YEARWOOD@SU-SCORE.ARPA Courses and Degrees
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Feb 84 09:36:09 PST
Date: Thu 9 Feb 84 09:33:42-PST
From: Marlene Yearwood <YEARWOOD@SU-SCORE.ARPA>
Subject: Courses and Degrees
To: zm@SU-AI.ARPA, jmc@SU-AI.ARPA, golub@SU-SCORE.ARPA, tob@SU-AI.ARPA,
cab@SU-AI.ARPA
cc: berg@SU-SCORE.ARPA, rwf@SU-AI.ARPA, acy@SU-AI.ARPA
Stanford-Phone: (415) 497-2266
Several weeks ago you received a copy of the courses you taught last year
with a request from Kathy that it be returned by Jan 31st with changes,
deletions, additions, etc. To date you have not returned this to her.
It is requested that this information be returned by Monday, 2/12, at
noon. Tardiness by a few people results in a delay for the whole department
in the C&D process, and as I am sure you are aware, it is not just the
Publications Office that suffers.
Please take the few minutes it requires to simply look over what Kathy
sent to you, make the necessary changes and return it. It will be most
appreciated by everyone.
Thank you.
-------
∂09-Feb-84 1001 GOLUB@SU-SCORE.ARPA column
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Feb 84 10:01:42 PST
Date: Thu 9 Feb 84 10:00:57-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: column
To: jmc@SU-AI.ARPA
I liked your thougtful piece in the Campus Reports. GENE
-------
∂09-Feb-84 1209 LAMPING@SU-SCORE.ARPA Re: ai reading list
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Feb 84 12:08:52 PST
Date: Thu 9 Feb 84 12:04:40-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Re: ai reading list
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 8 Feb 84 23:15:00-PST
I believe that it is impossible to change the reading list
this year, because it has already been "promissed" to students. What we
can do is to limit the exam to the intersection of the old reading
list and some other book, and announce this unofficially. I haven't
seen Rich's book, but certainly prefer Winston to the
Handbook, on the basis of reading the first edition
-------
One quarter's notice has been considered adequate in the past.
∂09-Feb-84 1509 PACK@SU-SCORE.ARPA Prolog program
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Feb 84 15:09:36 PST
Date: Thu 9 Feb 84 15:08:43-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Prolog program
To: jmc@SU-AI.ARPA
plan.pl[1,LEP] now has a better version. The old version used to
leave around old assertions if the plan failed. I hope to add colors
soon. if you try to build a tower with block1, block2, block1 it
succeeds by undoing what it did to build the bottom of the tower.
I'm thinking about how to fix that.
-Leslie
-------
∂09-Feb-84 1534 SHARON@SU-SCORE.ARPA Demo & room schedule
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Feb 84 15:34:18 PST
Date: Thu 9 Feb 84 15:33:09-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
Subject: Demo & room schedule
To: JMC@SU-AI.ARPA
You have room 352 from 1230 until 230Pm on Monday, 13-Feb-84. The advance
time was to allow for the equipment to be setup.
Len Bosack
-------
∂09-Feb-84 1645 SCHREIBER@SU-SCORE.ARPA Re: ai reading list
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Feb 84 16:42:52 PST
Date: Thu 9 Feb 84 16:39:04-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Re: ai reading list
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 8 Feb 84 23:15:00-PST
John,
My memo includes the CURRENT reading list. Don's is a proposed new list
that must first be approved by the faculty.
I agree: one book to replace AI Handbook
Rob
-------
∂09-Feb-84 1650 SCHREIBER@SU-SCORE.ARPA Meeting time
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Feb 84 16:49:58 PST
Date: Thu 9 Feb 84 16:48:51-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Meeting time
To: schreiber@SU-SCORE.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, abadi@SU-SCORE.ARPA, papa@SU-SCORE.ARPA,
wilson@SU-SCORE.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA
Sorry to have to do this, but several of us have real trouble with Tuesday
12:30 meetings. So please send me a message indicating slots you could
reserve for the meetings (remember there will be only four, so be
flexible.) If I find a better slot, I will reschedule them, otherwise they will stay at the times I announced.
Rob
-------
∂09-Feb-84 1657 SCHREIBER@SU-SCORE.ARPA Re: ai reading list
Received: from SU-SCORE by SU-AI with TCP/SMTP; 9 Feb 84 16:57:04 PST
Date: Thu 9 Feb 84 16:56:17-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Re: ai reading list
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 9 Feb 84 16:47:00-PST
John,
It's my opinion that the faculty's action is supposed to occur in the
spring and take effect with the following January comp. A student
who has read the AI Handbook this past fall would naturally be
displeased if she were obliged to now read all of Winston or Rich.
Rob
-------
Students rarely read that far in advance. Let's decide what's desirable,
and then find out if anyone objects. Anyway it probably wouldn't object
to taking the questions from the intersection of the AI Handbook and the
others.
∂09-Feb-84 1745 PETERS@SRI-AI.ARPA Meeting time
Received: from SRI-AI by SU-AI with TCP/SMTP; 9 Feb 84 17:45:39 PST
Date: Thu 9 Feb 84 17:45:32-PST
From: Stanley Peters <PETERS@SRI-AI.ARPA>
Subject: Meeting time
To: csli-b1@SRI-AI.ARPA
cc: bach-hong@SRI-AI.ARPA, lb@SRI-AI.ARPA
I got only two responses to my earlier request for times we should
rule out. On the strength of those, I propose Wednesdays at 2:15
as our regular meeting time. Though we probably won't meet every
week, we may well want to start next Wednesday, Feb. 15t, by meeting
from 2:15 till 3:30 or 4 to hear Jerry Hobbs.
If that time will not work for you, squawk now or forever hold
your peace.
-------
∂10-Feb-84 0703 ATP.BLEDSOE@UTEXAS-20.ARPA MCC
Received: from UTEXAS-20 by SU-AI with TCP/SMTP; 10 Feb 84 07:02:55 PST
Date: Fri 10 Feb 84 09:02:30-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: MCC
To: jmc@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
John,
I am now giving very serious consideration to going to MCC for 1-2 years.
I would take a leave of absence from UT for that period if I go. I have
not announced this yet and won't until I decide for certain (probably
in a week or so).
Why would I? They want me to help get the AI department going (I would
be VP and director of AI). I feel a definite urge to do what I can to
make the MCC effort go. (A kind of a "patriotic" feeling.) Also I
was always game for a challenge.
MCC is very important to UT and I would like to help see that the
AI part "gets started right". The university has given their
blessings to this, but are anxious that I continues to "be a
part of the University", and reuturn.
My first loyalty is to the University. I very much like it here
and can't imagine leaving for good. I also want to help in any way
that I can, their effort to build.
I strongly support the effort to attract you to UT even as a
visitor here next year. You can certainly consult at MCC if I go
there, whether or not you come to UT. Perhaps when you and Carolyn
come to Austin this Spring, you can go with me to MCC to discuss
their mission (dont take this as a duty of some sort but just an
opportunity - also they of course pay consulting fees).
Best regards,
Woody
Oh yes, I feel that the problems with AAAI and money are being solved
in a fair and honest (and legal) way. I have talked with VP Fonken
and his word is like gold to me. Also Austin Gleeson (Asso. Dean and
Chairman of the Physics Department) is right on top of it and
determined to see that AAAI is made happy. Of course Claudia is
aware of all of this. During her trip next week I hope everything
can be settled.
-------
∂10-Feb-84 0836 GOLUB@SU-SCORE.ARPA Re: the complaint
Received: from SU-SCORE by SU-AI with TCP/SMTP; 10 Feb 84 08:36:34 PST
Date: Fri 10 Feb 84 08:35:49-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Re: the complaint
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 9 Feb 84 23:25:00-PST
Thanks for your comments, John. Gene
-------
∂10-Feb-84 0901 SCHREIBER@SU-SCORE.ARPA Re: ai reading list
Received: from SU-SCORE by SU-AI with TCP/SMTP; 10 Feb 84 09:01:12 PST
Date: Fri 10 Feb 84 08:53:03-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Re: ai reading list
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 9 Feb 84 17:20:00-PST
Using the intersection is the simplest solution. Rob
-------
∂10-Feb-84 0917 KJB@SRI-AI.ARPA Doing one thing by doing something else
Received: from SRI-AI by SU-AI with TCP/SMTP; 10 Feb 84 09:17:25 PST
Date: Fri 10 Feb 84 09:17:00-PST
From: Jon Barwise <KJB@SRI-AI.ARPA>
Subject: Doing one thing by doing something else
To: csli-d2@SRI-AI.ARPA, csli-d3@SRI-AI.ARPA
cc: kjb@SRI-AI.ARPA, briansmith@PARC-MAXC.ARPA
This is a content note on an idea generated by yesterdays seminar.
In the semantics of OLP, I attached a certain kind of codition to
activity verbs. E.g., to MULPTIPLY I assigned the condition:
In SIT: at LOC2: multiplies, IND1, IND2, IND3; 1
at LOC3: result, INDR; 1
INDR = IND2 x IND3
LOC3 = re(LOC2)
and commented that this seemed odd, since it brought in the property
of being a result into the semantics of MULTIPLY. It was necessary in
order to get the various part of the discourse to fit together in a
coherent way. Michael's question yesterdays, and the discussion that
followed, disscussion points to a more natural way to do this, that
might suggest a more general treatment of things like moving the
coffee pot to wear out the sweater, etc. The rather obvious idea is
to clearly distinguish what constituts an action from what else that
action may involve, because of various necessary, nomic or
conventional constraints on the agent and his world.
This this simple example, consider the following necessary structural
constraint:
involves, E,E'; 1
where E is basically the first line of the above, and E' the other
three. That is, there is a structural constraint that in an
individual actually multiplies a by b in an interval I then at the end
of that there is a result and the result is the product of a and b.
Now factor the problem of the semantics of the command into two parts.
The condition on multiplies is just the first line, but there is a
general condition that all computatations have to meet the above
constraint. Then there is always a result around when needed, but it
is not brought in by the lexical semantics of MULTIPLY.
To generalize this, there are certain constraints that one type of
action ACT involves certain types E of consequences. Such constraint
can be exploited to achieve situations of type E by doing things of
type ACT. (This does not mean that every action of type E is thus also
of type E, of course, to answer Michael's objection.) But note that
this can also block an action of type ACT, if something blocks
situations of type E. E.g., going thru the door involves there being
nothing blocking the door (if I understood the film, this was Shakey's
assumption), so when Shakey encountered a blocking situation, he
abandonded that particular type of action.
Comments?
-------
∂10-Feb-84 0920 HOBBS@SRI-AI.ARPA Re: Meeting time
Received: from SRI-AI by SU-AI with TCP/SMTP; 10 Feb 84 09:20:22 PST
Date: Fri 10 Feb 84 09:20:28-PST
From: HOBBS@SRI-AI.ARPA
Subject: Re: Meeting time
To: PETERS@SRI-AI.ARPA
cc: csli-b1@SRI-AI.ARPA, bach-hong@SRI-AI.ARPA, lb@SRI-AI.ARPA
In-Reply-To: Message from "Stanley Peters <PETERS@SRI-AI.ARPA>" of Thu 9 Feb 84 17:45:37-PST
Could we postpone me until Feb 22? That would give me time to finish
the paper, distribute it, and figure out what to say. Also I'm giving
another talk the day before.
-- Jerry
-------
∂10-Feb-84 0954 Shoham@YALE Re: promise
Received: from YALE by SU-AI with TCP/SMTP; 10 Feb 84 09:54:18 PST
Received: by YALE-BULLDOG via CHAOS; Fri, 10 Feb 84 11:11:40 EST
Date: Fri, 10 Feb 84 11:13:53 EST
From: Yoav Shoham <Shoham@YALE.ARPA>
Subject: Re: promise
To: John McCarthy <JMC@SU-AI.ARPA>
In-Reply-To: John McCarthy <JMC@SU-AI.ARPA>, 09 Feb 84 1848 PST
Thanks for the message. As I recall, we were discussing problems with the
accessibility relation between possible worlds. In the mean time I have
seen some more of your work, and I have no specific questions that express
my general interest. The part of my work that seems to be most closely
related to your interests is an attempt to create a logic of causality
which solves some of the problems that other formalisms do not. If you have
any material that you consider relevant I'd be most interested in seeing it.
- Yoav.
-------
∂10-Feb-84 0959 DFH Inference expenses
No, we haven't invoiced them for the Feb. 2 trip
yet. I assume there were parking charges, and a
round trip to SJ. Meals? Taxi? Consulting Fee?
There is no consulting fee, because the arrangement has changed.
There is just round trip, $6 parking, $9 taxi, and I believe $128
air fare.
My phone doesn't work for outgoing calls either, so I call when I come
in.
∂10-Feb-84 1018 DFH phone calls
1. Your daughter Susan called and would like you to call her.
2. David Kennedy, H&S, 497-9784 would like you to call (I gave
him your home no. but Susan said it was out of order. He seemed
quite anxious to get ahold of you.)
∂10-Feb-84 1104 DFH message for Sarah
Mary Fischer called and says it is important
that Sarah get in touch with her as soon as
possible.
∂10-Feb-84 1252 AAAI-OFFICE@SUMEX-AIM.ARPA chapters in NW
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 10 Feb 84 12:52:03 PST
Date: Fri 10 Feb 84 12:52:23-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: chapters in NW
To: jmc@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
What we can provide Miro is a list of AAAI members in Washington,
Oregon and Idaho from our database. I do think we need to find
out how he plans to operate the local chapter, what are their
planned activities, do they plan to accept dues.
If you want our file on list of execcom officers, its called
"officers.83-84." FYI: our password is crsqbd. Or, if want,
I can send out your message from this office.
Claudia
-------
∂11-Feb-84 0854 CLT
i won't be around for supper tonight
i have my car
∂12-Feb-84 1600 JMC*
4:30 channel 5, Face the Nation
∂12-Feb-84 1659 JK class tomorrow
It might be better for me to talk wednesday - I think I will have
finished FOLISP by then. I currently doing the samefringe theorem -
it turns out that it (and gopher) can be defined quite nicely.
Carolyn points out that the the same scheme can be used to define
any partial function, like the 91 function.
Have found lots of bugs.
∂12-Feb-84 2242 JK
Carolyn's FOLISP is now in EKL, as EKLISP.LSP[PRF,JK]
The definition machinery has not been translated - high order
definitions are used throughout (there are no defax's).
The proofs are quite nice and short: Main awkwardness
is in the use of arithmetic information. The samefringe proofs also
eat up a lot of CPU, due to an inefficient indexing scheme. I am
planning on some other improvements, too.
Note the way samefr is defined: Using the same idea, one
can also define the 91 function and other programs.
I have added a high order schema to both lispax and natnum -
it seems quite useful.
append.lsp[prf,jk]
natnum.lsp[prf,jk]
length.lsp[prf,jk]
∂13-Feb-84 0815 DFH Stoyan/faculty club
I think I should have a copy of the bill for
the expense report.
∂13-Feb-84 1004 LAWS@SRI-AI.ARPA Re: expert systems for weather prediction
Received: from SRI-AI by SU-AI with TCP/SMTP; 13 Feb 84 10:04:40 PST
Date: Mon 13 Feb 84 10:05:44-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: Re: expert systems for weather prediction
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Sun 12 Feb 84 11:50:00-PST
I agree with you completely. My master's work concerned the modeling
of Kansas weather data based on a historical record extending back
for a hundred years. The results showed that there is a correlation
in the temperature patterns that extends back for a couple of days
(in addition to seasonal and other easily predicted long-term effects),
but that precipitation appears nearly random if you do not model the
spatial effects of fronts moving in.
The Farmer's Almanac is obviously based on seasonal averages and the
fact that readers won't object if a predicted event is off by a day
or two either way. Predict five rains in June, each plus or minus
two days, and you've covered the entire month. Anyway, the algorithm
they use is a trade secret.
-- Ken
-------
∂13-Feb-84 1016 SCHREIBER@SU-SCORE.ARPA Meeting times decided!
Received: from SU-SCORE by SU-AI with TCP/SMTP; 13 Feb 84 10:16:03 PST
Date: Mon 13 Feb 84 10:14:54-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Meeting times decided!
To: schreiber@SU-SCORE.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
wilson@SU-SCORE.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Thanks for your quick replies.
Unless someone thinks of a really good objection, I will announce May 19/20
as the date of the exam on Friday.
It is clear from your responses that Tuesday 12:30 is the best we can do
for meetings. Free lunch will be provided. There will be only 4 such
meeting!
The first meeting is quite important. We review the whole exam and critique
one anothers questions. Since one of us cannot make it March 20, but all
can come April 10, I have pushed the schedule back. I will meet with the
subcommittees and discuss their proposed question during the week March 26-30.
The questions will be TEXed and distributed during the following week
April 2-6. We all meet to review and revise the questions on April 10
(Tuesday, 12:30).
The exam will be pretested between the 10th and the 24th. Let's meet
on the 24th to review the results and make final changes. Please mark
this date on your calendar. No meeting March 20; add meeting April 24.
Remember: the subcommittees should find a pretester for their sections.
Mail for the whole committee can be sent via <schreiber>comp.dis@score.
Thanks for your keen interest!
Rob
-------
∂13-Feb-84 1604 ullman@diablo Shahid Mujtaba
Received: from SU-HNV by SU-AI with TCP/SMTP; 13 Feb 84 16:04:25 PST
Date: Mon, 13 Feb 84 16:02 PST
From: Jeff Ullman <ullman@diablo>
Subject: Shahid Mujtaba
To: feigenbaum@sumex, golub@score, jmc@sail
I finally remembered what I had promised to do at our last meeting,
and called Mujtaba, who is (apparently) the author of a reasonable
fraction of AL. I got the sense that it is a dead issue, as he is
no longer interested in using the language, but that the allegations
of the students are substantially true. Mujtaba did not seem to
know that he had some proprietary rights to AL, and felt that for
some reason, Binford dropped the ball as far as negotiations on
a license were concerned. There is apparently a letter from
Grubman (HP) to Osborn (SPO) outlining this feeling, however, we should
remember that this took place in late 1981 an has been dormant since.
∂13-Feb-84 1605 @MIT-MC:BERWICK.BRADFORD@MIT-OZ FORGETFUL
Received: from MIT-MC by SU-AI with TCP/SMTP; 13 Feb 84 16:04:18 PST
Date: Mon 13 Feb 84 18:49:46-EST
From: BERWICK.BRADFORD%MIT-OZ@MIT-MC.ARPA
Subject: FORGETFUL
To: jmc@SU-AI.ARPA
JUST CAME ACROSS MY NOTE ABOUT OUR TALK IN YOUR OFFICE
FOUR MONTHS AGO : THE QUATATION FROM DAVID MARR WHICH
WE USED AT THE HEADING OF OUR FELDMAN-HAYES-RUMELHART
BROCHURE IS TO BE FOUND ON PAGE 349 OF THE W.H.FREEMAN
BOOK. I SHOULD REMEMBER TO REQAD MY NOTES MORE OFTEN.
HOPE ALL IS WELL THERE: WE ARE BLOOMING. HOPE TO SEE YOU
BEFORE AAAI IN TEXAS IN AUGUST 8 (THOUGH NOT EVERYONE
RELISHES THE IDEA OF TEXAS IN AUGUST. IF YOU PLAN A TRIP TO
CAMBRIDGE, LET ME KNOW. HARRY STANTON
-------
∂13-Feb-84 2311 HST LISP HISTORY
To: JMC
CC: HST
HI JOHN.AS I'VE SAID THEN WHEN I WAS VISITING YOU AT HOME I DID NOT FIND
THE MATERIAL I WAS SEARCHING FOR (THE 1.TH VERSION OF APPLY).HOWEVER IT
TURNED OUT THAT ANOTHER PIECE OF PAPER WAS CONTAINED IN THE STUFF YOU
COPIED AND SENT ME NOW:A PAPER WRITTEN BY YOURSELF AND DIRECTED TO PERLIS
AND TURANSKI.IT IS IMPORTANT BECAUSE YOU PROPOSED TO HAVE THE LAMBDA-NOTA-
TION IN THE SUCCESSOR OF ALGOL.
IT WOULD BE NICE IF YOU COULD TRY TO REMEMBER SOME THINGS:
1.IN THE PAPER YOU MENTION THAT "MATERIAL WAS CUT OUT OF VOLUME 1".
IT SEEMS THAT ALL MATERIAL WHICH WAS INTENDED FOR ALGOL WAS PUT INTO
A VOLUME 1 AND THE REST WAS "CUT OUT".DO YOU REMEMBER WHAT ELSE WAS
CUT OUT?
2.WHEN REALLY YOU BECAME INVOLVED WITH ALGOL? IS THIS PAPER OF JUNE 10TH
IN 1958 A REGULAR CONTRIBUTION OR ONLY A PROPOSAL OF SOMEBODY (YOU) WHICH
IS STILL OUTSIDE?
3.IN THE FIRST LISP MEMO THE MAPLIST FUNCTION IS DEVELOPED WITHOUT LAMBDA-
NOTATION.I HAD THE VIEW THAT IT WAS WRITTEN IN SEPTEMBER 58.IF I SEE NOW
LAMBDA-NOTATION AS PART OF YOUR THINKING ALREADY IN JUNE 58 I ASK MYSELF
IF THIS DATE IS RIGHT.THE DATE (OF THE MEMO 1)WAS NOT PRINTED ON THE MEMO
BUT WRITTEN BY NAT ROCHESTER.
HERBERT
It seems to me that I was a part of the U.S. Algol 58 committe, but I was
not one of those who went to Europe, and I didn't take an active part.
However, it is also possible that I didn't become associated with Algol
until after the 58 meeting. I'm pretty sure that at the time I sent
the memo to Perlis and Turanski, I must have been a member of the Algol
committee. I'll look at the memo and see if I can recall something
else. At present I don't remember doing differentiation without lambda.
Note that it isn't necessary to use lambda to define maplist - only to
use it.
∂14-Feb-84 0625 @MIT-MC:PHW@MIT-OZ Wolf, Goat and Grain
Received: from MIT-MC by SU-AI with TCP/SMTP; 14 Feb 84 06:25:15 PST
Date: Tue, 14 Feb 1984 09:23 EST
Message-ID: <PHW.11991672320.BABYL@MIT-OZ>
From: "Patrick H. Winston" <PHW%MIT-OZ@MIT-MC.ARPA>
To: John McCarthy <JMC@SU-AI.ARPA>
Subject: Wolf, Goat and Grain
In-reply-to: Msg of 14 Feb 1984 04:16-EST from John McCarthy <JMC at SU-AI>
Thanks for the note. Regrettably, I probably cant fix the problem
until the next edition.
Patrick
∂14-Feb-84 1029 ME AP line
∂14-Feb-84 0042 JMC
AP is garbage now. Why does this happen, and how does it get fixed?
ME - I don't really know. It may have been a transmission line
problem, or some other problem at the AP end, as seems to happen
now and then. It's working fine now.
Next time it happens, you could try typing
.TTY EXIST 16,17
to the monitor to reset the speeds of those lines, but I doubt
if that would have done anything this time since the problem
fixed itself.
∂14-Feb-84 1200 greep@SU-DSN Re: riddle
Received: from SU-DSN by SU-AI with PUP; 14-Feb-84 12:00 PST
Date: Tuesday, 14 Feb 1984 11:59-PST
From: Steven Tepper <greep@SU-DSN>
To: John McCarthy <JMC@SU-AI>
Cc: su-bboards@SU-AI
Subject: Re: riddle
In-reply-to: Your message of 14 Feb 84 1100 PST.
Re: "What did the goat say about the recent texts in AI?"
I hope it didn't have anything to do with "goat-to" statements or lack
thereof.
∂14-Feb-84 1529 HOLTZMAN@SUMEX-AIM.ARPA Proving prescriptive theorems.
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 14 Feb 84 15:29:04 PST
Date: Fri 10 Feb 84 17:16:34-PST
From: Samuel Holtzman <HOLTZMAN@SUMEX-AIM.ARPA>
Subject: Proving prescriptive theorems.
To: JMC@SU-AI.ARPA
cc: holtzMAN@SUMEX-AIM.ARPA
Dear Professor McCarthy:
I am writing a dissertation on computer-based medical decision
analysis, and I have question about formal logic that you might be
able to answer. The point seems quite intuitive to me but, after
checking with Mike Genesereth (with whom I have done quit a bit of
work), it appears that it may not be as simple as I originally
thought. I have taken the liberty of sending you this message in
hopes that you might provide me with some insight or, at least, some
pertinent references.
My claim is that it is not possible to deduce a PRESCRIPTIVE assertion
from a system of axioms and theorems, none of which is prescriptive.
Therefore, if we describe a situation with a set of factual statements
(axioms), and we then apply a formal decision method (a set of
theorems) to this description, the only way in which we can obtain a
prescriptive conclusion is if the formal method contains AT LEAST ONE
THEOREM whose consequent is PRESCRIPTIVE.
I would appreciate your comments on the above claim.
Thank you for your help,
Sam Holtzman
(HOLTZMAN@SUMEX)
-------
I have thought about the matter before, and my opinion is the same
as yours. Some philosopher, probably nineteenth century, put it
this way, "You can't derive an ought from an is". However, as soon
as you admit one ought into your axioms, then with the help of facts,
you may be able to derive many more oughts. The people who thought
they were derving oughts from ises always let one ought, e.g. survival,
sneak into their systems. The relevant technical result is presumably
much simpler. Given an arbitrary predicate, OUGHT in the present
case, we cannot derive a conclusion in which this predicate occurs
postively unless it occurs positively in some premiss. Intuitively,
it would seem that there are stronger theorems. Under suitable conditions,
we can allow rules that have P in both premiss and conclusion but
still be unable to derive any P(a) unless there is some P(x)
unconjoined with not P(y) somewhere in the premisses.
∂14-Feb-84 1602 PEDNAULT@SRI-AI.ARPA AI Research Projects
Received: from SRI-AI by SU-AI with TCP/SMTP; 14 Feb 84 16:02:32 PST
Date: Tue 14 Feb 84 16:03:07-PST
From: PEDNAULT@SRI-AI.ARPA
Subject: AI Research Projects
To: TOB@SU-AI.ARPA, ROD@SU-AI.ARPA, Buchanan@SUMEX-AIM.ARPA,
Feigenbaum@SUMEX-AIM.ARPA, Genesereth@SU-SCORE.ARPA, Lenat@SU-SCORE.ARPA,
ZM@SU-AI.ARPA, JMC@SU-AI.ARPA, ALS@SU-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA,
TW@SU-AI.ARPA
cc: PEDNAULT@SRI-AI.ARPA
Gentlemen:
This coming Monday (Feb 20), a group of Canadian students will be
visiting the Stanford campus and I have been asked to give them a
short talk on the research being done here in artificial intelligence.
Accordingly, I would greatly appreciate receiving a short description
of each of your research progects --- research-in-progress notes would
fit the bill nicely. This would make my job easier and ensure that I
properly represent your work.
On-line copy can be sent to me here at SRI-AI and hardcopy to
ERL 416 via ID mail.
Anything, even a list of titles, would be most appreciated.
Thanks,
Ed Pednault
-------
∂14-Feb-84 2000 EJH@SU-SCORE.ARPA Re: riddle
Received: from SU-SCORE by SU-AI with TCP/SMTP; 14 Feb 84 20:00:49 PST
Date: Tue 14 Feb 84 20:00:44-PST
From: Eric J. Horvitz <EJH@SU-SCORE.ARPA>
Subject: Re: riddle
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Tue 14 Feb 84 11:00:00-PST
What did the goat say about the texts?
-------
∂14-Feb-84 2210 LUNDSTROM@SU-SCORE.ARPA Discussions about potential research projects
Received: from SU-SCORE by SU-AI with TCP/SMTP; 14 Feb 84 22:09:59 PST
Date: Tue 14 Feb 84 22:09:54-PST
From: Stephen Lundstrom <LUNDSTROM@SU-SCORE.ARPA>
Subject: Discussions about potential research projects
To: jmc@SU-AI.ARPA
cc: lundstrom@SU-SCORE.ARPA
I have been having some discussions with Dick Gabriel, Ed Feigenbaum,
Joe Oliger, folks at Los Alamos, ... about potential interesting
research areas. Some of these include:
1. LISP on Multiprocessors (such as the HEP, the ELXSI, ...)
2. A modeling environment for real-world physical problems (potentially
the confluence of AI and numeric supercomputing)
3. Bringing the Palladio experiment into a high-performance environment
and expanding it for potential use in an operational environment
(CIS)
4. Performance projection and analysis of the above (both to eventually
develop means to predict performance of planned applications and
to contribute to future improved architectures and system organizations
for such applications)
I would appreciate the opportunity to "bounce" some of these ideas around
with you, and to see if you would want to be involved (or take on) any
of them. Tomorrow (Wed.) am, Bill Buzbee from Los Alamos will be with me
starting about 9am. We will be discussing these topics also, since one of
the immediate possibilities is a joint proposal where Stanford and
Los Alamos would approach DARPA for funding of some of the above. Our
discussions to date are certainly not firmed up, but there are some
strong common interests. (If you are interested in joining all or
part of my discussions with Bill, you are welcome - or we could come
to visit you.) Except for that meeting, I will be available tomorrow
until 3:00pm. I will be out of town either Thurs or Fri on IEEE
Computer Society business (probably Thurs). Monday (20th) I am booked,
but have most of the rest of that week open.
(For your information, I have been at Stanford for just over 1 year now -
am Assoc. Prof (Research) in EE - Computer Systems Lab. I am actively
participating in CIS since I was hired to assist Meindl in planning
CIS support facilities and systems design capabilities (among other things).)
Look forward to hearing from you. Steve Lundstrom
(if you want to call me, I am at 497-0140.)
-------
Steve,
I'm interested and will call you tomorrow, probably in mid-morning.
Dick has no doubt told you about our work, originally mine and now
almost entirely his, on Lisp for multi-processors. Perhaps I'll have
more ideas in that area. I'm also interested in combining AI and
numerical computing. Edward Teller asked me, a year or two ago, to look
at a proposal by Chandrasekharan of Ohio State on an AI system for
helping reactor operators, and I concluded that the AI proposed could work well
only in conjunction with a numerical simulation of the entire nuclear
and steam system. My understanding is that other people have come to
similar conclusions. I don't have specific ideas of my own and would
be happy to listen to yours.
John McCarthy
∂15-Feb-84 0203 LENAT@SU-SCORE.ARPA Re: an idea
Received: from SU-SCORE by SU-AI with TCP/SMTP; 15 Feb 84 02:03:37 PST
Date: Wed 15 Feb 84 02:03:31-PST
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: Re: an idea
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Tue 14 Feb 84 15:25:00-PST
I had considered the same initial idea (mutating a program) but more
LITERALLY than you did: one of Eurisko's domains is Lisp Programming.
In it, it did a few interesting things, such as
(1) Coalesce PROGN: (LAMBDA (Z) (PROGN Z Z)), which got it the notion
of "side effects"
(2) Coalesce NCONC: (LAMBDA (Z) (NCONC Z Z)), which makes it easy to tell
if Z (was a) list, by printing out Z and waiting a few minutes to see if it's
done yet.
(3) Notice that EQ is a specialization of EQUAL, so it hypothesized that
(OR (EQ x y) (EQUAL x y)) might be faster than EQUAL alone, since EQ was
much faster than EQUAL. Strangely enough, it was correct (!!) and that
turned out to be a bug in the then-volatile Interlisp-D language (now fixed.)
The more genral sense of "program", however, had not occurred to me as
suitable, but it certainly is. Moreover, Eurisko might well find some
nonstandard instances of the generalized algebraic structures it defined,
examples in wargaming, programming, oil spill spreading, and other domains
it already has knowledge of (and simulators for).
Thanks for the suggestions, John.
Regards,
Doug
-------
I don't understand your latest message very well, and this shows that
I understand your whole project less well than I thought. Can we get
together again, since I take it that you put off your trip?
∂15-Feb-84 0753 LUNDSTROM@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 15 Feb 84 07:53:16 PST
Date: Wed 15 Feb 84 07:53:04-PST
From: Stephen Lundstrom <LUNDSTROM@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Tue 14 Feb 84 23:18:00-PST
I'll look forward to your call. Sorry I wasn't in when you called last
night on the phone. Steve
-------
∂15-Feb-84 1022 JK proposal
To: "@SATO.DIS[1,CLT]"
YK has texed a version of the proposal.
Please let her know if you want to see it before it is sent to Sato.
One more thing that is required:
Please send me the grant number(s) and title(s) of the NSF grants
currently supporting you.
In case your primary research support comes from outside of NSF, you
are in trouble: In that case, arrangements must be made to send to
INT/NSF a letter concurring in the inclusion of the project.
∂15-Feb-84 1155 LAMPING@SU-SCORE.ARPA Comp
Received: from SU-SCORE by SU-AI with TCP/SMTP; 15 Feb 84 11:55:44 PST
Date: Wed 15 Feb 84 11:55:27-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Comp
To: JMC@SU-AI.ARPA
I have just scanned Elain Rich's book. I like it. I would have no
qualms about restricting the comp questions to the intersection
of that book and the handbook.
-------
∂15-Feb-84 1207 LAMPING@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 15 Feb 84 12:07:52 PST
Date: Wed 15 Feb 84 12:07:37-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 15 Feb 84 12:04:00-PST
I prefer Rich, as she seems to give a more balanced coverage. Also, her
diagrams seem to give a good idea of what real systems can start to
look like.
-------
John Lamping and I have agreed that Elaine Rich's book should eventually
replace the Handbook for the AI part of the Comprehensive and that the
present exam should be based on on the intersection. Unless you
disagree, we propose to announce that the exam will be based on
the intersection and send an appropriate notice to bboard.
∂15-Feb-84 1223 JDM Do you have a copy of ...?
I have a very poor copy of Pas Hayes's paper "Some PRoblems and Non-Problems
in Representation Theory" that was published in the Summer Conference
of the AISB in 1974. (Took place in Czechoslovakia I think). Do
you have a copy of this paper?
Jock
It is in the index to my collection, but I can't find it. Therefore,
I'd like to copy yours (Diana will do it), but maybe only if you
can't find a better copy somewhere.
∂15-Feb-84 1300 JMC*
M.I.T. papers for HST
∂15-Feb-84 1303 PETERS@SRI-AI.ARPA Areas B1 and D4 meetings
Received: from SRI-AI by SU-AI with TCP/SMTP; 15 Feb 84 13:03:46 PST
Date: Wed 15 Feb 84 13:04:08-PST
From: Stanley Peters <PETERS@SRI-AI.ARPA>
Subject: Areas B1 and D4 meetings
To: csli-b1@SRI-AI.ARPA
Jerry Hobbs has asked that we postpone his talk from today. And
several other folks have belatedly sent me their schedules,
listing conflicts. In light of the new information, it looks
like Monday afternoons at 3:15 would be a better time than
Wednesday afternoons. Can people please give me their reactions
to this idea?
Since Jerry has to give a different talk next Tuesday, he prefers
to talk in our meetings after that. So I propose we meet Monday
Feb. 27th at 3:15 to hear him. If anyone wants to talk this
coming Monday, the 20th, they should let me know so I can
announce the meeting.
And, again, if the Monday time won't work, please let me know
right away. Thanks.
-------
jmc
name on list
Please change my name on the csli-b1 automatic mailing list from
JMC@SU-AI to JMC-LISTS@SU-AI. I like to get mail sent to lists
in this way.
∂15-Feb-84 1515 PETERS@SRI-AI.ARPA
Received: from SRI-AI by SU-AI with TCP/SMTP; 15 Feb 84 15:15:27 PST
Date: Wed 15 Feb 84 15:16:05-PST
From: Stanley Peters <PETERS@SRI-AI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 15 Feb 84 14:15:00-PST
Right. I'll do it.
-------
∂15-Feb-84 1954 LENAT@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 15 Feb 84 19:54:10 PST
Date: Wed 15 Feb 84 19:53:58-PST
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 15 Feb 84 10:36:00-PST
I delayed my trip until Thursday evening (about 24 hours from now),
and will be back Monday night. How about getting together Wed. the 22nd,
the day before the faculty meeting discussing my tenure case?
Terry Winograd| will be coming over to PARC to see Eurisko run from
about 11:30-2, but any other time would be fine (including Tuesday
evening or Wednesday evening if necessary). We probably can meet at
your office at MJH, unless there's something specific you wanted
to see with Eurisko "live". If NONE of these times are OK,
then I can rearrange my schedule a bit tomorrow, Thursday, and
meet anytime between 4 and 9 pm, but this is not ideal.
Regards,
Doug
PS: I think that Texas Instruments would like you to come out
to Texas and speak to them soon, as part of "maintaining them"
for the Forum. Since I am the official maintainer (I visited them
last year, by the way), the usual Forum policy is to split
the maintenance fee. If you won't get your expenses paid somehow,
though, I propose we deduct your travel expenses and then split
the remainder of the fee. If you don't have any idea what I'm talking
about, the TI people must not have caught you at the Forum meeting,
and I'll tell you about it when we get together.
-------
lenat%score
meeting
The only good time is Wednesday evening, because I will be in L.A.
Tuesday and Wednesday during the day. So how about Wednesday
evening at 8:45 in my office? The TI people got in touch, and I
agreed to visit, but they didn't mention that it would be in
connection with the forum. If they regard it as such, then I'll
accept your offer. I'll have no other source of expenses unless
they pay.
∂15-Feb-84 2130 DFH* Stoyan bill
Remember to bring the bill so I can copy it.
∂15-Feb-84 2246 Zdybel.pa@PARC-MAXC.ARPA Re: riddle
Received: from PARC-MAXC by SU-AI with TCP/SMTP; 15 Feb 84 22:46:10 PST
Date: Wed, 15 Feb 84 22:45:07 PST
From: Zdybel.pa@PARC-MAXC.ARPA
Subject: Re: riddle
To: John McCarthy <JMC@SU-AI.ARPA>
cc: su-bboards@SU-AI.ARPA
In-Reply-To: "JMC@SU-AI.ARPA's message of Wed, 15 Feb 84 10:26:00 PST"
I love it! Happy Friday eve. !
Frank
∂15-Feb-84 2316 ZM Industrial Professors
John,
I have encouraged two researchers to apply for this position:
Dr. Joe Halpern -- IBM San Jose
Dr. Raphael Rom -- SRI International
They are EXCELLENT lecturers and they have each offered to teach
a one-quarter course.
Strongly recommend !! Zohar
∂16-Feb-84 0019 WIEDERHOLD@SUMEX-AIM.ARPA Re: Industry lecturers
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 16 Feb 84 00:19:14 PST
Date: Thu 16 Feb 84 00:19:40-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: Industry lecturers
To: JMC@SU-AI.ARPA
cc: ellis@PARC-MAXC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 15 Feb 84 23:26:00-PST
I thought that Skip Ellis, from Xerox PARC was also interested. I'll
check.
Gio
-------
∂16-Feb-84 0506 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay knowledge seminar, Feb. 24
Received: from SU-HNV by SU-AI with TCP/SMTP; 16 Feb 84 05:05:59 PST
Received: from rand-relay.ARPA by Diablo with TCP; Thu, 16 Feb 84 05:01:21 pst
Date: 15 Feb 1984 17:43:51-PST (Wednesday)
From: Joe Halpern <HALPERN.IBM-SJ@Rand-Relay>
Return-Path: <HALPERN.SJRLVM1.IBM-SJ@Rand-Relay>
Subject: knowledge seminar, Feb. 24
To: KNOWLEDGE@SU-HNV
Cc: konrad.ucsc@Rand-Relay
Via: IBM-SJ; 16 Feb 84 2:36-PST
The knowledge seminar will be continuing as scheduled on Feb. 24,
at 10 AM. Our speakers will be Kurt Konolige of SRI and Yoram Moses
of Stanford. The abstracts are included below. Our speaker for
March 9 will be Bob Moore of SRI and Hector Levesque of Fairchild.
See you then.
A Deduction Model of Belief -- Kurt Konolige
Most current formal models of belief for AI planning systems are
derivatives of a possible-world semantics for belief. However, this
model suffers from epistemological and heuristic inadequacies.
Epistemologically, it assumes that agents know all the consequences of
their belief. This assumption is clearly inaccurate, because it
doesn't take into account resource limitations on an agent's reasoning
ability. For example, if an agent knows the rules of chess, it then
follows in the possible-world model that he knows whether white has a
winning strategy or not. On the heuristic side, proposed mechanical
deduction procedures have been first-order axiomatizations of the
possible-world semantics, an indirect and inefficient method of
reasoning about belief.
A more natural model of belief is a deduction model: an agent has a
set of initial beliefs about the world in some internal language, and
a deduction process for deriving some (but not necessarily all)
logical consequences of these beliefs. Within this model, it is
possible to account for resource limitations of an agent's deduction
process; for example, one can model a situation in which an agent
knows the rules of chess but does not have the computational resources
to search the complete game tree before making a move.
This talk will be about the deduction model of belief and its
formalization by modal logic families. I will discuss some of the
following issues:
1. the correspondence between the deduction and possible
world model;
2. a theory of ignorance;
3. a theory of introspection.
A formalization of the Wise Man Puzzle and a derivative, the
not-so-wise-man problem, will also be given.
Knowledge and Common Knowledge In Distributed Systems -- Yoram Moses
The notion of knowledge in a distributed environment is fundamental to many
issues in distributed computing. Many tasks in a distributed system
directly involve the achievement of specific states of knowledge and others
crucially depend on a variety of constraints on the state of knowledge of
the parties involved. Communication in a distributed system can be viewed
(and in some cases should be viewed) as the act of transforming the system's
state of knowledge. Of particular importance is the notion of Common Knowledge,
which can be viewed as the generalization of an individual's knowledge to a
group. Common knowledge is inherent in notions such as agreement.
We investigate the conditions needed to achieve common knowledge of a fact in a
distributed system, showing that there are practical problems in achieving it
in actual systems. We present a new related notion, called epsilon common
knowledge that corresponds to the knowledge state achievable in some reasonable
systems. We show how this notion can be incorporated into a logic of knowledge,
and compare it with common knowledge. We discuss the logical and practical
implications of this to actual knowledge and action in distributed environmemts.
This work is joint with Joe Halpern of IBM San Jose.
HALPERN.SJRLVM1.IBM-SJ@Rand-Relay
name on lists
Please replace my name (JMC@SU-AI) on your seminar notification list
by JMC-LISTS@SU-AI, but continue to use JMC@SU-AI for messages not sent
to lists. Does your new and longer installation name also apply to
Moshe Vardi and Ron Fagin?
∂16-Feb-84 1042 cheriton@diablo Re: Industry lecturers
Received: from SU-HNV by SU-AI with TCP/SMTP; 16 Feb 84 10:38:06 PST
Date: Thu, 16 Feb 84 09:50 PST
From: David Cheriton <cheriton@diablo>
Subject: Re: Industry lecturers
To: JMC@SU-AI
I have had Ed Lazowska of U. of Washington express interest in teaching
a course at Stanford while on sabbatical at the new DEC research lab in Palo
Alto. Does this qualify as an industrial lecturer? (This is for next year)
cheriton@diablo
industry lecturer
It does, but I'd need the catalog description, vitae and optional longer
description promptly.
∂16-Feb-84 1117 cheriton@diablo Re: industry lecturer
Received: from SU-HNV by SU-AI with TCP/SMTP; 16 Feb 84 11:17:46 PST
Date: Thu, 16 Feb 84 11:17 PST
From: David Cheriton <cheriton@diablo>
Subject: Re: industry lecturer
To: JMC@SU-AI
I'll see what I can do.
∂16-Feb-84 1139 DFH biojmc
I added the Psychology Today article. Pub doesn't
seem to like the font "B" in the CBCL reference.
∂16-Feb-84 1153 HOLTZMAN@SUMEX-AIM.ARPA Proving OUGHT from ISes
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 16 Feb 84 11:53:10 PST
Date: Thu 16 Feb 84 11:52:33-PST
From: Samuel Holtzman <HOLTZMAN@SUMEX-AIM.ARPA>
Subject: Proving OUGHT from ISes
To: jmc@SU-AI.ARPA
cc: genesereth@SUMEX-AIM.ARPA, holtZMAN@SUMEX-AIM.ARPA
Dear Professor McCarthy:
Thank you for your note on proving OUGHTs from ISes. In
particular, I agree with your statement:
"Given an arbitrary predicate, OUGHT in the present
case, we cannot derive a conclusion in which this
predicate occurs positively unless it occurs positively
in some premise".
I am glad to find that my intuition agrees with yours.
For your information, I am using this argument to claim that,
at present, our best choice for a NORMATIVE theory of decision is the
formal methodology known as "Decision Theory," which is based on
subjective probability as a measure of uncertainty, and on the
principle of maximization of expected utility (MEU) as an "action
axiom" (i.e., the axiom with an OUGHT in it). To me, any action axiom
is a leap of faith, because it makes a statement about the real world
on the basis of a formal condition. As such, it must be accompanied
by a convincing argument justifying its wisdom; otherwise it is pretty
useless other than as dogma. My claim is founded on the fact that
people like Leonard Savage have given powerful arguments in favor of
MEU, the likes of which do not exist (to my knowledge) for any other
action axiom.
Knowing that an action axiom (and, hence, a leap of faith)
MUST exist in any normative theory of decision is crucial to the
above argument. Otherwise, it would be possible to build such a
theory without the leap (as many statisticians have tried to do), and
the need for justification would disappear, at least in principle.
Given your comments, I feel confident that an action axiom is a
necessary part of normative decision theories.
Again, thank you for your help.
Sincerely,
Sam Holtzman.
-------
HOLTZMAN@SUMEX-AIM
ought and is
I don't agree with MEU - either as describing actual human behavior,
as a norm for human behavior, or what should be built into computer
programs. I think my objection is different from those usually given,
and it applies to any unitary ought rule, i.e. a rule deriving all
oughts from a single principle.
People appear to have a wide variety of rules, learned at different
times, determining their goals and what ought or ought not be done
to accomplish them. This can and does lead to conflicts between what
the different rules advocate. Since one of our dislikes is internal
conflict, one human goal is to discover and adopt a general rule that
will encompass all the specific rules and enable us to avoid internal
conflict and also to provide a justification for others. However, I
don't believe this can be done except for in limited models of reality
parametrized in advance. My reasons for believing this are still somewhat
vague and are related to a whole collection of ideas about non-monotonic
reasoning. However, here are a few remarks.
1. When someone formulates a general rule, it is typically criticized
by bringing up examples that the author of the rule hasn't thought of.
Often concepts that the author thought were clear turn out to be
ambiguous in the circumstances postulated in the examples.
2. That our concepts have limited applicability is the normal intellectual
situation of humans and it will be normal for machines also. We can
only formulate rules governing small (in some sense) models of
certain aspects of the world. These rules may be unambiguous
in the cases encountered in existence of a particular human or machine,
but there is no reason to suppose that they won't be ambiguous
in cases that might arise.
3. Let me propose a semi-mathematical problem. Suppose that we have
a collection of a dozen or so ought rules. Suppose that we have
a certain parametrized set of circumstances, and suppose that
the prescriptions of the set of rules are unambiguous and intuitively satisfactory
in these circumstances. Suppose now that we propose to expand
the collection of circumstances considered. It may happen that
the rules become ambiguous or that the results are intuitively
unsatisfactory. Is there necessarily a more comprehensive rule
that will give even approximately the same results in the limited
circumstances, which can be compactly formulated and which is
intuitively satisfactory. My opinion is that this is not guaranteed.
Therefore, when we invent rules of behavior for robots, we will have
provide a collection covering the circumstances we can anticipate,
and we can expect conflicts when certain unanticipated circumstances
occur.
4. But surely, you may argue, the robot will exhibit some behavior
in the unanticipated circumstances, and isn't this the general rule.
Yes, but the robot's behavior may be intuitively unsatisfactory.
In particular it may depend on adventitious aspects of the situation,
such as which horn of the dilemma was encountered first.
I don't know whether any of this is relevant to the problems you are
trying to solve, so I'll stop.
∂16-Feb-84 1307 Solomon.Datanet@MIT-MULTICS.ARPA invitation to a preview
Received: from MIT-MULTICS by SU-AI with TCP/SMTP; 16 Feb 84 13:07:31 PST
Acknowledge-To: Solomon@MIT-MULTICS.ARPA
Date: Thu, 16 Feb 84 13:16 EST
From: Solomon@MIT-MULTICS.ARPA (Richard Jay Solomon)
Subject: invitation to a preview
To: rivest@MIT-ML.ARPA, minksy@MIT-OZ.ARPA, jward@MIT-CIPG.ARPA,
jmc@SU-AI.ARPA, ware@RAND-UNIX.ARPA
Message-ID: <840216181621.036684@MIT-MULTICS.ARPA>
An invitation to members of the MIT community and others in the
Boston area who aided in our production to preview the first
segment of edited videotapes. Viewing time: 51 minutes. Coffee,
tea, and cookies.
SNEAK PREVIEW!
THE COMPUTER PIONEERS: PART I
ORIGINS OF THE STORED PROGRAM
COMPUTER DURING WORLD WAR II
An Experiment in Video Oral History
made possible by a grant from the
Sloan Foundation
WHEN: 2:15 PM, Thursday, Feb. 23, 1984.
PLACE: Marlar Lounge, 2nd Floor, Bldg. 37, 70 Vassar Street.
(We have scheduled this preview to end prior to the regular
Communications Policy seminar which begins in the same room at
4PM. The subject this week is networking standards.)
QUESTIONS: Call Richard Solomon at 413 267-5171 or 617 253-5159.
∂16-Feb-84 1408 ZM The syllabus
∂16-Feb-84 0658 Rom@Sri-Tsca The syllabus
Received: from SRI-TSCA by SU-AI with TCP/SMTP; 16 Feb 84 06:58:40 PST
Date: 16 Feb 84 6:46-PDT
From: rom.tsca@sri-tsca
To: ZM@Su-Ai
CC: rom.technion@Sri-Tsc
Subject: The syllabus
Random Access Techniques in Computer networks
Syllabus:
Elementary queuing systems (short revision). The M/G/1 Queue.
Throughput and delay computation. The ALOHA scheme. Carrier sense
schemes. Collision Detection. Ethernet. Window random access tech-
niques. Collision free access. Unidirectional systems. Input sensi-
tive schemes.
Prerequisite:
Knowledge of advanced probability and M/M/1 queue analysis.
References (Sample):
1. L. Kleinrock and F. A. Tobagi, "Packet Switching in Radio Channels:
Part I - Carrier Sense Multiple-Access Modes and Their Throughput
Delay Characteristics," IEEE Trans. on Communications, Vol. COM-23,
(12) pp. 1400-1416 (December 1975).
2. F. A. Tobagi and V. B. Hunt, "Performance Analysis of Carrier Sense
Multiple Access with Collision Detection," Computer Networks, Vol.
4, (5) pp. 245-259 (October/November 1980).
3. I. Chlamatac, W. R. Franta, and K. D. Levin, "BRAM: The Broadcast
Recognizing Access Mode," IEEE Trans. on Communications, Vol. COM-
27, (8) pp. 1183-1189 (August 1979).
4. L. Kleinrock and M. Scholl, "Packet Switching in Radio Channels:
New Conflict-Free Multiple Access Schemes for a Small Number of
Data Users," pp. 22.1-105-22.1-111 in ICC Conf. Proceedings, IEEE,
(June 1977).
5. N. Shacham and V. B. Hunt, "Performance Evaluation of the CSMA-CD
1-Persistent Channel Access Protocol in Common Channel Local Net-
works," in Proc. of the International Symposium on Local Computer
Networks, IFIP TC-6, Florence, Italy (April 1982).
6. D. Towsley and G. Venkatesh, "Window Random Access Protocols for
Local Computer Networks," IEEE Transaction on Computers, Vol. C-31,
(8) pp. 715-722 (August 1982).
7. N. F. Maxemchuk, "A Variation on CSMA/CD That Yields Movable TDM
Slots in Integrated Voice/Data Local Networks," Bell System Techni-
cal Journal, Vol. 61, (7) pp. 1527-1550 (September 1982).
8. R. Rom, "Performance Analysis of the Unidirectional Broadcast Sys-
tem," pp. 505-520 in Proc. of the International Symposium on Local
Computer Networks, IFIP TC-6, Florence, Italy (April 1982).
rom.tsca@sri-tsca,zm/cc
course
Thanks for the course description. I may have more applications than slots,
so I'll let you know next week or perhaps the week after.
∂16-Feb-84 1408 ZM the resume
∂16-Feb-84 0659 Rom@Sri-Tsca the resume
Received: from SRI-TSCA by SU-AI with TCP/SMTP; 16 Feb 84 06:59:37 PST
Date: 16 Feb 84 6:45-PDT
From: rom.tsca@sri-tsca
To: ZM@Su-Ai
CC: rom.technion@Sri-Tsc
Subject: the resume
January 1983
Curriculum Vita -- Raphael Rom
Education
B.Sc. (1968) and M.Sc. (1971) in electrical engineering, Technion -
Israel Institute of Technology, Haifa, Israel.
Ph.D. (1975) in computer science, University of Utah, Salt Lake City,
Utah, U.S.A.
Employment Record
1981 - Present: Senior lecturer, Department of Electrical Engineering,
Technion, Haifa, Israel.
1975 - Present: Senior Researcher, SRI International (Stanford Research
Institute), California, U.S.A.
1972 - 1975: Research Assistant, Department of Computer Science,
University of Utah.
1968 - 1972: Research Assistant, Department of Electrical Engineer-
ing, Technion, Israel.
Specialized Professional Avctivities
Local data distribution networks; Computer communication network archi-
tectures; Distributed Systems; Computer networks performance analysis;
Computer communications protocols; Interactive software systems; Elec-
tronic message systems.
Publications (Sample)
"Reliable Host-to-Host Protocols: Problems and Techniques," Proc. 5th
Data Communications Symposium, Snowbird, Utah, September 1977.
"Deafnet: A distributed Communication Service for the Deaf," SRI interim
report (project 7883), Menlo-Park California, May 1980.
"Efficient Round-Robin and Priority Schemes in Unidirectional Broadcast
Systems," Proc. of the IFIP WG 6.4 Local Area Networks, Zurich, Switzer-
land, August 1980.
"Communication Technology for Increasing Productivity," Proc. of the
Software Engineering Conference, Capri, Italy, October 1980.
"Message-Based Priority Functions in Local Multiaccess Communication
Systems," Computer Networks, Vol 5, No. 4, July 1981.
"Performance Evaluation of the Unidirectional Broadcast System," Proc
of the International Symposium on Local Computer networks, Florence,
Italy, April 1982.
"Name Assignment in Computer Networks", Department of Electrical
Engineering Publication # 439, Technion, Haifa, October 1982.
"Ordering Subscribers on Cable Networks", Department of Electrical
Engineering Publication # 446, Technion, Haifa, November 1982.
"A New Approach for Netowrk Name Management", Proc. INFOCOM, San Diego,
Calfiornia, April 1983.
"CSMA With Collision Detection for Radio Channels", To be published.
"Packet Fragmentation and Routing in Computer Networks", To be pub-
lished.
∂16-Feb-84 1409 ZM The letter (Please confirm receipt)
∂16-Feb-84 0700 Rom@Sri-Tsca The letter (Please confirm receipt)
Received: from SRI-TSCA by SU-AI with TCP/SMTP; 16 Feb 84 07:00:10 PST
Date: 16 Feb 84 6:43-PDT
From: rom.tsca@sri-tsca
To: ZM@Su-Ai
CC: rom.technion@Sri-Tsc
Subject: The letter (Please confirm receipt)
Dr. Raphael Rom
Dept. of Electrical Engineering
Technion City
Haifa 32000, Israel.
February 16, 1984
Prof. J. McCarthy
Department of Computer Science
Stanford University
Stanford,
CA 94303
Dear Prof. McCarthy
I am a staff member of SRI International, spending this year in the
Department of Electrical Engineering and Computer Science at the Techn-
ion in Israel. Next year I will be back in California and would like to
teach a class in your department, possibly as an Industrial Professor.
My area of interest is data communication networks and the subject
of the class I have in mind is random access techniques in data communi-
cations. This is a mathematically oriented course for upper graduate
students which I developed and have taught twice here in Israel. A gen-
eral syllabus is attached.
If such a class does not fit the department's repertoire, I shall
be glad to teach any class in the data communications area.
As to references, Prof .Z. Manna knows me well, and of course Dr.
Don Nielson and Mr. Jack Goldberg of SRI. Additional references can be
provided if required.
Sincerely,
Attachments.
∂16-Feb-84 1554 HALPERN.SJRLVM1.IBM-SJ@Rand-Relay message lists, etc.
Received: from RAND-RELAY by SU-AI with TCP/SMTP; 16 Feb 84 15:54:09 PST
Date: 16 Feb 1984 12:30:17-PST (Thursday)
From: Joe Halpern <HALPERN.IBM-SJ@Rand-Relay>
Return-Path: <HALPERN.SJRLVM1.IBM-SJ@Rand-Relay>
Subject: message lists, etc.
To: JMC@SU-AI
Via: IBM-SJ; 16 Feb 84 15:14-PST
John, I will have your name changes on the message lists. Also,
I don't think you should need to put SJRLVM1 in the header for mail
sent here. HALPERN.IBM-SJ@RAND-RELAY should work just fine (likewise
for FAGIN and VARDI). -- Joe
∂16-Feb-84 1629 DFH I left slightly early.
∂16-Feb-84 1718 WALDINGER@SRI-AI.ARPA Industrial Lectureship
Received: from SRI-AI by SU-AI with TCP/SMTP; 16 Feb 84 17:17:50 PST
Delivery-Notice: While sending this message to SU-AI.ARPA, the
SRI-AI.ARPA mailer was obliged to send this message in 50-byte
individually Pushed segments because normal TCP stream transmission
timed out. This probably indicates a problem with the receiving TCP
or SMTP server. See your site's software support if you have any questions.
Date: Thu 16 Feb 84 17:18:24-PST
From: WALDINGER@SRI-AI.ARPA
Subject: Industrial Lectureship
To: jmc@SU-AI.ARPA
cc: waldinger@SRI-AI.ARPA, zm@SU-AI.ARPA
Here is a catalog-style course description for a Seminar in
Porgram Synthesis, in support of my application for an
Industrial Lectureship for the Spring Quarter of next year (1985).
Seminar in Program Synthesis:
Recent research on the systematic derivation of programs
to meet given specifications, with an emphasis on deductive
approaches. Related topics in theorem proving, logic prog-
gramming, planning, and program transformation. Individual
projects and some student presentations.
Prerequisites: CS157 A/B or equivalent.
∂16-Feb-84 1756 Ellis.pa@PARC-MAXC.ARPA Re: Industry lecturers
Received: from PARC-MAXC by SU-AI with TCP/SMTP; 16 Feb 84 17:56:35 PST
Date: 16 Feb 84 08:49:25 PST (Thursday)
From: Ellis.pa@PARC-MAXC.ARPA
Subject: Re: Industry lecturers
In-reply-to: Your message of Thu, 16 Feb 84 00:24:24 PST
To: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>, John McCarthy
<JMC@SU-AI.ARPA>
cc: ellis.pa@PARC-MAXC.ARPA
Oops, it seems the catalog description below which i mailed several
weeks ago never reached John McCarthy. Looks like i goofed the initials.
Sorry John:
--------------------
Date: 3 Feb 84 09:54:17 PST (Friday)
From: Ellis.pa
Subject: Office Information Systems course outline
To: JMB@SU-AI
cc: Golub@SU-SCORE, Ellis
Here is the abbreviated course outline that you requested. I hope it is
in time to make it into the course catalog. -skip ellis
CS209. (or some number) Office Information Systems Design.
Technology, techniques, and design paradigms of electronic office
information systems. The objective is to present a coherent and cohesive
foundation for the understanding and analysis of office systems and
their implementation. Topics include: basic components and media such as
word processors, workstations, PBXs, and local area networks; office
firmware such as RasterOps, virtual keyboards, phone handlers, and
window managers; office system elements such as document editors, mail
systems, calendaring systems, and distributed servers. The course will
describe and discuss issues of user interfaces, user programming, office
modeling, and the social / organizational structures within which the
technology must exist. Prerequisites: computer organization (e.g.
cs111,cs112), computer software (e.g. cs142,cs146).
"ellis.pa"%parc-maxc
course
We would like you to give your office information systems course as
part of the industrial professor program. Winter quarter is preferred.
Unless you have some other pay arrangement concerning what I hear is
a sabbatical, we would pay $3000 or 1/16 of your annual salary, which
is less. Please reply promptly, because the information is going into
the catalog.
waldinger%sri-ai
course
We would like you to give your program synthesis course as
part of the industrial professor program. Autumn quarter is preferred.
We would pay $3000 or 1/16 of your annual salary, which
is less. Please reply promptly, because the information is going into
the catalog.
"ellis.pa"%parc-maxc
course
I am assuming that, as I proposed, that you agreed to teach your course
in the Fall quarter, but I forget whether you actually agreed to it.
∂16-Feb-84 2151 HAYM@SU-SCORE.ARPA CS206 Final
Received: from SU-SCORE by SU-AI with TCP/SMTP; 16 Feb 84 21:50:28 PST
Date: Thu 16 Feb 84 21:50:21-PST
From: Haym Hirsh <HAYM@SU-SCORE.ARPA>
Subject: CS206 Final
To: jmc@SU-AI.ARPA
What is the result of the regrading?
haym
-------
∂17-Feb-84 0516 SIMONDS@CMU-CS-C.ARPA Re: electronic library
Received: from CMU-CS-C by SU-AI with TCP/SMTP; 17 Feb 84 05:15:51 PST
Received: ID <SIMONDS@CMU-CS-C.ARPA>; Fri 17 Feb 84 08:11:13-EST
Date: Fri 17 Feb 84 08:11:13-EST
From: SIMONDS@CMU-CS-C.ARPA
Subject: Re: electronic library
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 15 Feb 84 09:36:00-EST
John,
This system going down in two minutes; long response to follow.
Budget for your project approved; good metting between Raj and Mike
this week.
Crash!
--Todd
-------
∂17-Feb-84 0925 TW
John, I sent your blurb about industrial professors to Jim Horning, who
had mentioned an interest in teaching, and got the following reply. I'll
leave it to you and him to follow up. --t
----
Terry,
I am interested in principle in teaching such a course next year. I'm
not sure that I will be able to sort out a course description, etc. in
time for your catalog deadline.
∂17-Feb-84 0925 TW
John, I sent your blurb about industrial professors to Jim Horning, who
∂17-Feb-84 0959 DFH lunch today
with Zohar's NEC visitors. Carolyn Tajnai will
bring them to your office about 11:50 am.
∂17-Feb-84 1014 ATP.BARBARA@UTEXAS-20.ARPA UT Situation- from Claudia Mazzetti
Received: from UTEXAS-20 by SU-AI with TCP/SMTP; 17 Feb 84 10:14:16 PST
Date: Fri 17 Feb 84 12:14:42-CST
From: Barbara Smith <ATP.Barbara@UTEXAS-20.ARPA>
Subject: UT Situation- from Claudia Mazzetti
To: JMC@SU-AI.ARPA, Walker@SRI-AI.ARPA, Fikes%usc-ecld@USC-ECL.ARPA,
aaai-office@SUMEX-AIM.ARPA, Bledsoe@UTEXAS-20.ARPA, Rich@UTEXAS-20.ARPA,
brachman@SRI-KL.ARPA
cc: atp.barbara@UTEXAS-20.ARPA
I believe I have some good news to tell you. The University
has agreed to allow the AAAI to keep our surplus funds for
the conference (incl all 3 programs). We agreed that the
AAAI will pay for all out-of-pocket expenses ( ie UT police
services, electicians, guides, room rental fees).
These points of agreement are expressed in the following letter (note:
the letter is from the AAAI to UT) and the Revised Building Use
Agreement form. I've been assured that the letter will be signed off
by the VP of Academic Affairs and the VP of Business Affairs. This
letter will act as agreement of our mutual understanding of the AAAI's
financial responsibilities to UT.
My only reservation regarding this matter was the possibility of an
audit by UT auditors. Their response was that they control the
auditors, and, anyway, audits of activities in the Performing Arts
Center are only concerned about fraud and theft of tickets.
I admit I had some serious reservations about this matter.But,when I
met with Dr. Fonken and UT legal counsel in which they explictly
stated we could keep the extra surplus and that both VPs would
sign off on the letter and revised agreement, my reservations
disappeared. One thing I was asked to do was to tell you to keep
this agreement quiet. The University usually doesn't accomodate
outside groups as they have in this case.
I'd like to hear your comments soon so that we can proceed with
the preparation with the conference.
Regards,
Claudia
P.S. Let's thank Woody for getting in there and getting to the right
people in the University.
**********************************************************
(This letter went through many iterations between Assoc Dean Gleason
myself; Gleason suggested the original format for this letter)
Dr. Gerald Fonken
Vice President of Academic Affairs
and Research
MAI 201
Mr. G. Charles Franklin
Vice President for Business Affairs
MAI 102
Dear Vice Presidents Fonken and Franklin:
The American Association for Artificial Intelligence (AAAI) is holding
its national meeting at Austin, Texas in 1984. The meeting is
scheduled to take place from August 6-10, 1984. Although the meeting
headquarters and registration site is in the Villa Capri Hotel [ This
is one of the concession I had to make; originally registration was to
occur on campus; pls note the Villa Capri is a 3 min walk to the
Performing Arts Center; at least at the Villa, we will be able to sell
conference proceedings and memberships], the association has requested
use of the facilities at the University of Texas at Austin for some of
its sessions. The Depts of Mathematics and Computer Sciences and the
College of Natural Sciences are co-sponsors of this event. The
facilities we intend to use are the Performing Arts Center for large
plenary sessions and rooms in the Thompson Conference Center for
tutorials. As a part of the conference we are sponsoring the displays
of new equipment related to the field of artificial intelligence in
the scene shop of the PAC. Our estimated attendance is more than 2000
computer scientists who will be accomodated in the hotels in Austin
and in Jester Center.
I attached an estimated income and expense statement fo r the
operation of the conference on your campus. We understand that
the only financial obligations of AAAI to the University in regard to
the conference will be indicated in the items of the budget.[ ie
facilities costs]. In addition, this letter shall serve as the only
agreement between the AAAI and the University in regard to
financial matters. We would appreciate your review of the attached
budget and outline of the conference plan stated above. If it
appears acceptable, please indicate your review and acceptance by
signing below and then return it to me for your records. Additional
copies are attached for your files.
We appreciate the hospitality of the University in sharing its
facilities for our conference. This ......
Sincerely yours,
John McCarthy
President
----------------------------- -----------------------------
Reviewed and Accepted by Reviewed and Accepted by
G.J. Fonken, Vice G.C. Franklin, Vice President for
President for Academic Business Affairs
Affairs and Research
Budget Statement
AAAI STatement
[Pls note all these figures have been either increase by 10% for
expenses or decreased by 10% for revenues)
Anticated Revenues:
Technical Program Fees $177,600
Tutorial Program Fees $240,000
Total Revenues $418,600
[ Pls note exhibit program fees are not included; they said since
we collect these funds before the conference, they don't want to
know about them.]
Anticpated Expenses
Registration Refunds $ 25,300
Speaker Payments 112,000
AAAI Management Cost (ie
overhead) 100,000
Facilities Costs 55,000
Printing, Advertising, & Postage 81,959
Travel and accomodations 15,000
Catering and Shuttle Buses 45,100
Total Expenses 434,359
**********************************************
Building Use Agreement
College of Fine Arts, Performing Arts Center
UT
The text of the original use agreement remains the same, except for
the following sections:
* Move-in/move-out fees are eliminated.
* deposit section is eliminated.
* Section on Financial Policy (this section stipulates
the return of excess income) is eliminated.
-------
ATP.Barbara@UTEXAS-20,aaai-office@sumex
agreement
This is for Claudia Mazzetti if she's still at Texas. She'll get it
here too.
The agreement looks ok. Congratulations to you and all who co-operated.
The phrase "return it to me for your records" should read "return it to
me for our records".
∂17-Feb-84 1518 PACE@USC-ECL.ARPA Re: UT Situation- from Claudia Mazzetti
Received: from USC-ECL by SU-AI with TCP/SMTP; 17 Feb 84 15:17:56 PST
Mail-from: DECNET site ECLD rcvd at 17-Feb-84 1414-PST
Date: 17 Feb 1984 1414-PST
From: Richard Fikes <FIKES%USC-ECLD%USC-ECL@MARYLAND>
Subject: Re: UT Situation- from Claudia Mazzetti
To: ATP.Barbara@UTEXAS-20, JMC@SU-AI, Walker@SRI-AI,
Fikes%usc-ecld%USC-ECL@MARYLAND,
<@USC-ECL:@UTEXAS-20>>, aaai-office@SUMEX-AIM, Bledsoe@UTEXAS-20,
Rich@UTEXAS-20,
<@USC-ECL:@UTEXAS-20>>, brachman@SRI-KL
cc: FIKES%USC-ECLD%USC-ECL@MARYLAND
In-Reply-To: Your message of 17-Feb-84 1018-PST
Good Work! Looks fine. I assume you will be showing the letter and
agreement to our attorney. I would like to know if she has any
concerns about it.
richard
-------
∂17-Feb-84 1556 SCHREIBER@SU-SCORE.ARPA Re: AI readings
Received: from SU-SCORE by SU-AI with TCP/SMTP; 17 Feb 84 15:56:02 PST
Date: Fri 17 Feb 84 15:55:49-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Re: AI readings
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Wed 15 Feb 84 12:13:00-PST
Fine with me
-------
∂17-Feb-84 2125 PACK@SU-SCORE.ARPA Bird axioms
Received: from SU-SCORE by SU-AI with TCP/SMTP; 17 Feb 84 21:25:11 PST
Date: Fri 17 Feb 84 21:25:04-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Bird axioms
To: jmc@SU-AI.ARPA
It occured to me during your lecture today that I'm handling the blocks
world in a different way that you were doing the bird example. Below
are the same axioms expressed in the two ways. The second way will
make the same inferences, but perhaps the circumscription doesn't work
correctly?
The way JMC does it:
~ ab aspect1 x -> ~ flies x
bird x -> ab aspect1 x
bird x & ~ ab aspect2 x -> flies x
ostrich x -> ab aspect2 x
ostrich x & ~ ab aspect3 x -> ~flies x
A simpler way:
~ ab aspect1 x -> ~ flies x
ab aspect1 x -> flies x
bird x & ~ ab aspect2 x -> ab aspect1 x
ostrich x & ~ ab aspect3 -> ab aspect2 x
-------
pack%score
abnormality
It seems to me that with your axioms, minimizing ab won't lead to the
conclusion that Tweety, known only to be a bird, flies. We will
just get
ab aspect2 Tweety or ab aspect1 Tweety.
I still haven't gotten around to reading your Prolog program, but I
hope to do so this weekend. We should get together next week anyway,
though I'll be gone Tuesday and Wednesday. Thursday afternoon
after 3 might be ok if convenient for you.
∂17-Feb-84 2308 PACK@SU-SCORE.ARPA is-a hierarchy solution?
Received: from SU-SCORE by SU-AI with TCP/SMTP; 17 Feb 84 23:07:58 PST
Date: Fri 17 Feb 84 23:07:48-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: is-a hierarchy solution?
To: jmc@SU-AI.ARPA
I'm not sure what question you were asking, but here is a solution to
some related problem.
Rules for expressing a general is-a hierarchy. We must know about the
direct ancestor of a particular class in the hierarchy. I left tweety
out of the example, because the relationship is member-of rather than
subset-of.
1. [Ax.ancestor(class)(x) -> p(x)] & ~ab aspectn(class,p) ->
[Ax.class(x) -> p(x)]
2. [Ax.ancestor(class)(x) -> p(x)] & ab aspectn(class,p) ->
[Ax.class(x) -> ~p(x)]
3. [Ax.ancestor(class)(x) -> ~p(x)] & ~ab aspectn(class,p) ->
[Ax.class(x) -> ~p(x)]
4. [Ax.ancestor(class)(x) -> ~p(x)] & ab aspectn(class,p) ->
[Ax.class(x) -> p(x)]
An example:
This relation expresses the hierarchy.
ancestor(animal) = thing
ancestor(bird) = animal
ancestor(canary) = bird
ancestor(ostrich) = bird
ancestor(penguin) = bird
The default is that things don't fly.
[Ax.thing(x) -> ~flies(x)]
These things are different than their immediate predecessors in the hierarchy
ab aspectn(bird,flies)
ab aspectn(ostrich,flies)
ab aspectn(penguin,flies)
Using rule 3,
[Ax.ancestor(animal)(x) -> ~flies(x)] & ~ab aspectn(animal,flies) ->
[Ax.animal(x) -> ~flies(x)]
[Ax.thing(x) -> ~flies(x)] & ~ab aspectn(animal,flies) ->
[Ax.animal(x) -> ~flies(x)]
One of our assumptions is that the first part of the antecedent is
true. By circumscription of abnormality we find the second part of
the antecedent also true, making the consequent true. Thus we can
conclude
[Ax.animal(x) -> ~flies(x)]
Using rule 4,
[Ax.ancestor(bird)(x) -> ~flies(x)] & ab aspectn(bird,flies) ->
[Ax.bird(x) -> flies(x)]
[Ax.animal(x) -> ~flies(x)] & ab aspectn(bird,flies) ->
[Ax.bird(x) -> flies(x)]
By the previous conclusion and our known abnormality of birds and
flying in aspect n, we have
[Ax.bird(x) -> flies(x)]
Using rule 1,
[Ax.ancestor(canary)(x) -> flies(x)] & ~ab aspectn(bird,flies) ->
[Ax.canary(x) -> flies(x)]
[Ax.bird(x) -> flies(x)] & ~ab aspectn(canary,flies) ->
[Ax.canary(x) -> flies(x)]
We conclude that all canaries can fly.
Using rule 2,
[Ax.ancestor(penguin)(x) -> flies(x)] & ab aspectn(penguin,flies) ->
[Ax.penguin(x) -> ~flies(x)]
[Ax.bird(x) -> flies(x)] & ab aspectn(penguin,flies) ->
[Ax.penguin(x) -> ~flies(x)]
Thus, no penguins can fly.
-------
pack@score
is-a
I haven't checked whether your proposed is-a formalization suffers
from the same problem as your bird formalization. However, it
doesn't meet my goal in another way, and that is your use of an
ancestor function; if it were an ancestor relation, that would be
ok, but you use it as a parent function. For example, you write
ancestor(bird) = animal, but you might have written
ancestor(bird) = vertebrate and ancestor(vertebrate) = animal.
Our human inheritance algorithm, whatever it may be, does not
require a fixed parentage chain. It can deal with the situation
in which there are an unknown or even undefined number of intermediates
between bird and animal. This is the goal I tried to state.
Returning briefly to your first message, let me state the goal that
axiom systems should be devised so that circumscribing ab gives
a definite result in those cases where our informal reasoning would
give a definite result.
Please persist in your efforts to formulate axioms. A few more tries
and you'll get some I won't be able to find flaws in. At least they
won't be the same flaws that I found in some of my own previous efforts.
If there is anything unclear about these comments, I'll be glad to discuss
them either in person or by phone. My home phone is 857-0672, and I'm usually
free to talk except at dinner time.
∂18-Feb-84 1536 SHORTLIFFE@SUMEX-AIM.ARPA schedule for Kuipers visit
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 18 Feb 84 15:36:42 PST
Date: Sat 18 Feb 84 15:37:00-PST
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: schedule for Kuipers visit
To: fagan@SUMEX-AIM.ARPA, bhayes-roth@SUMEX-AIM.ARPA, blum@SUMEX-AIM.ARPA,
shortliffe@SUMEX-AIM.ARPA, friedland@SUMEX-AIM.ARPA,
eengelmore@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA,
clancey@SUMEX-AIM.ARPA, rindfleisch@SUMEX-AIM.ARPA,
buchanan@SUMEX-AIM.ARPA, genesereth@SUMEX-AIM.ARPA, rdg@SU-AI.ARPA,
vian@SUMEX-AIM.ARPA, lenat@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
Office: Room TC-117, Stanford Med Center; Phone: (415) 497-6979
Appended below is the final schedule for the visit to the HPP by
Ben Kuipers. Let me know if there are any problems. Also, please note
where I've indicated he should meet with you. If you want that changed,
please let me know asap.
Thanks,
Ted
------------
Visit of Ben Kuipers
23-24 February 1984
Thursday, February 23:
11:30am - 1:15pm: lunch (hosts: Larry Fagan and Bob Blum)
Meet in TC-135
1:15pm - 2:15pm: Ted Shortliffe (TC-135)
2:30pm - 3:30pm: Barbara Hayes-Roth (701 Welch Road)
3:30pm - 4:15pm: Peter Friedland (701 Welch Road)
4:15pm - 4:45pm: Russ Greiner (will walk him over to MJH from
Welch Road)
4:45pm - 5:45pm: Mike Genesereth (MJH)
5:45pm - 6:30pm: free time
6:30pm: dinner (Genesereth will bring Kuipers)
Faculty Club
Friday, February 24:
8:30am - 9:30am: Tom Rindfleisch (701 Welch Road)
9:30am - 10:30am: Bruce Buchanan (701 Welch Road)
10:30am - 11:30am: Bill Clancey (701 Welch Road)
11:30am - 12:00pm: free
12:00pm - 1:15pm: SIGLUNCH presentation (Gazebo)
1:15pm - 2:00pm: Ed Feigenbaum (MJH)
thereafter: free
-------
∂19-Feb-84 2313 HST algol history
from the "socio-.. history of algol "(annual review in automatic programming
vol5)i retrieve the fact that on the 26th oct 1957 john carr prposed to
gather an us (better acm) delegation for work with algol.he mentioned that
prof.morse is asked to send somebody of his lab into this group.
the first meeting of the "ad-hoc" committee was 1/24/58.
the third meeting was 4/18/58.
the travel to europa was from 27th of may to 2th of june 58.backus,katz,perlis
and wegstein were the acm-delegation.
your name is first mentioned in connection with the "acm programming language
committee" meeting at 5.-6.nov.1959.
is it possible to reach perlis by net-mail?
hst
algol history
I would imagine that I was the person Morse sent. At least it seems to
me that no-one else went to the meetings. I'm pretty sure that I went
to at least one meeting before the delegation went. I don't know
whether Perlis is reachable; I've certainly never received any net
mail from him, and he is not in the 1980 ARPAnet directory. I'll
check the more recent directory in the office.
∂20-Feb-84 1054 LENAT@SU-SCORE.ARPA Re: meeting
Received: from SU-SCORE by SU-AI with TCP/SMTP; 20 Feb 84 10:54:35 PST
Date: Mon 20 Feb 84 10:54:23-PST
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: Re: meeting
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 16 Feb 84 20:49:00-PST
That's fine, John. See you Wednesday evening, 8:45, your office.
Regards
Doug
-------
∂20-Feb-84 1318 WALKER@SRI-AI.ARPA Re: UT Situation- from Claudia Mazzetti
Received: from SRI-AI by SU-AI with TCP/SMTP; 20 Feb 84 13:18:24 PST
Date: Mon 20 Feb 84 13:19:18-PST
From: Don Walker <WALKER@SRI-AI.ARPA>
Subject: Re: UT Situation- from Claudia Mazzetti
To: ATP.Barbara@UTEXAS-20.ARPA
cc: JMC@SU-AI.ARPA, Fikes%usc-ecld@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA,
Bledsoe@UTEXAS-20.ARPA, Rich@UTEXAS-20.ARPA, brachman@SRI-KL.ARPA
In-Reply-To: Message from "Barbara Smith <ATP.Barbara@UTEXAS-20.ARPA>" of Sat 18 Feb 84 01:13:21-PST
Congratulations all; that letter sounds wonderful, and I deeply appreciate
Woody's intercessions. I am not surprised that he was able to effect
a solution. As you say, Claudia, we certainly must respect the University's
special treatment of the AAAI Conference. In short, a good situation.
Thanks for everybody's good work and particularly for Claudia's blood,
sweat, tears, and high anxiety.
Don
-------
∂20-Feb-84 1622 PACK@SU-SCORE.ARPA another try
Received: from SU-SCORE by SU-AI with TCP/SMTP; 20 Feb 84 16:22:46 PST
Date: Mon 20 Feb 84 16:22:35-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: another try
To: jmc@SU-AI.ARPA
Here is another try at making the is-a hierarchy more general. I'm
not yet sure if the circumscription works, but the axioms have a
similar form to the ones that you use for the specific bird example.
I'll come and talk at 4:30 on Thursday.
Rules for expressing a general is-a hierarchy.
If there is some ancestor of the class we are concerned which for
which the property holds for all memebers, and the ancestor, current
class and property are not abnormal in aspect1 then the property holds
for all members of the current class.
1. [Ec.is-ancestor(c,class) & [Ax.c(x) -> p(x)] & ~ab aspect1(c,class,p)] ->
[Ax.class(x) -> p(x)]
The same as axiom 1, only expressing the inheritance of negative properties.
2. [Ec.is-ancestor(c,class) & [Ax.c(x) -> ~p(x)] & ~ab aspect1(c,class,p)] ->
[Ax.class(x) -> ~p(x)]
If there is an odd number of descendents of the first class who are
ancestors of or equal to the second class which are abnormal with
relation to the predicate we are considering, then the truth of the
predicate is not inherited.
3. [Es.[Ac.[is-ancestor(class1,c) &
[is-ancestor(c,class2) v equal(c,class2)] &
ab aspect2(c,p)] <->
member(c,s)] &
odd (cardinality (s))] ->
ab aspect1(class1,class2,p)
Restated in ppc -- a little easier to see the structure
2. (if (exist s (and (all c (if-only-if (and (is-ancestor class1 c)
(or (is-ancestor c class2)
(equal c class2))
(ab (aspect2 c p)))
(member c s)))
(odd (cardinality y))))
(ab (aspect2 class1 class2 p)))
Now we need to say something positive about such classes...
If there is an odd number of intervening abnormalities and the ancestor
class has the property then the descendent class does not have the property.
3. (if (and (exist s (and (all c (if-only-if (and (is-ancestor class1 c)
(or (is-ancestor c class2)
(equal c class2))
(ab (aspect2 c p)))
(member c s)))
(odd (cardinality y))))
(not (ab (aspect3 class1 class2 p)))
(all x (if (class1 x)
(p x))))
(all x (if (class2 x)
(not (p x)))))
Negative version
4. (if (and (exist s (and (all c (if-only-if (and (is-ancestor class1 c)
(or (is-ancestor c class2)
(equal c class2))
(ab (aspect2 c p)))
(member c s)))
(odd (cardinality y))))
(not (ab (aspect3 class1 class2 p)))
(all x (if (class1 x)
(not (p x)))))
(all x (if (class2 x)
(p x))))
An example:
This relation expresses the hierarchy.
is-ancestor(thing,animal)
is-ancestor(thing,bird)
is-ancestor(thing,penguin)
is-ancestor(thing,canary)
is-ancestor(thing,dog)
is-ancestor(animal,penguin)
is-ancestor(animal,dog)
is-ancestor(animal,canary)
is-ancestor(bird,canary)
is-ancestor(bird,penguin)
The default is that things don't fly.
[Ax.thing(x) -> ~flies(x)]
These things are different than their immediate predecessors in the hierarchy
ab aspect2(bird,flies)
ab aspect2(ostrich,flies)
ab aspect2(penguin,flies)
Using rule 2,
[Ec.is-ancestor(c,animal) & [Ax.c(x) -> ~flies(x)] &
~ab aspect1(c,animal,flies)] ->
[Ax.animal(x) -> ~flies(x)]
Instantiate c to thing
is-ancestor(thing,animal) & [Ax.thing(x) -> ~flies(x)] &
~ab aspect1(thing,animal,flies) ->
[Ax.animal(x) -> ~flies(x)]
All that we need to show is ~ab aspect1(thing,animal,flies). We shall
assume it is not abnormal unless we can prove that it is using axiom 3.
[Es.[Ac.[is-ancestor(thing,c) &
[is-ancestor(c,animal v equal(c,animal)] &
ab aspect2(c,p)] <->
member(c,s)] &
odd(cardinality(s)) ->
ab aspect1(thing,animal,flies).
We have no classes satisfying the requirements for membership in s, so
its cardinality is 0 which is not odd. Since we cannot prove its
abnormality, we conclude ~ ab aspect1(thing,animal,flies), which
allows us to conclude our goal, Ax.(animal(x) -> ~flies(x)).
Now, let us see if birds can fly...
Using rule 1 as before we can easily arrive at the following:
~ab aspect1(thing,bird,flies) -> [Ax.bird(x) -> ~flies(x)]
In this case, however, we find s in axiom three equal to {bird}. The
cardinality of s is odd, and so we conclude ab aspect1(thing,bird,flies).
Rule 2 cannot tell us anything about the flight of birds, so we try
rule 4. Its antecedents are all satisfied because we assume the normality
of aspect3 in absence of information about it. Thus, we can conclude
[Ax.bird(x) -> flies(x)].
In trying to prove whether or not penguins can fly, we try rule 2. It
is easily reduced to
~ab aspect1(thing,penguin,flies) -> [Ax.penguin(x) -> ~flies(x)].
In using rule 3 to try to disprove the antecedent, we find the set
e equal to {bird,penguin}. Its cardinality is even, so we have failed
to prove ab aspect1(thing,penguin,flies). We can conclude
[Ax.pengiun(x) -> ~flies(x)].
We might have approached this problem differently. If we had our
result from the previous example ([Ax.bird(x) -> flies(x)]) we might
have reduced our problem to
~ab aspect1(bird,penguin,flies) -> [Ax.penguin(x) -> flies(x)].
Since, however, our set e in axiom 3 is {penguin}, this will fail and we
have to use axiom 4 to conlude that penguins cannot fly.
-------
∂20-Feb-84 2050 ATP.BLEDSOE@UTEXAS-20.ARPA Re: UT Situation- from Claudia Mazzetti
Received: from UTEXAS-20 by SU-AI with TCP/SMTP; 20 Feb 84 20:50:17 PST
Date: Mon 20 Feb 84 22:50:38-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: UT Situation- from Claudia Mazzetti
To: WALKER@SRI-AI.ARPA, ATP.Barbara@UTEXAS-20.ARPA
cc: JMC@SU-AI.ARPA, Fikes%usc-ecld@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA,
Bledsoe@UTEXAS-20.ARPA, Rich@UTEXAS-20.ARPA, brachman@SRI-KL.ARPA,
ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "Don Walker <WALKER@SRI-AI.ARPA>" of Mon 20 Feb 84 15:18:57-CST
I too want to go record to say that Claudia did a superb job in Austin.
She had a cooperative Univeristy to deal with, but she handled it just
right: standing up for AAAI's rights without ruffling their feathers.
I'm impressed.
Woody
-------
∂21-Feb-84 0817 SHORTLIFFE@SUMEX-AIM.ARPA revised (final?) schedule
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 21 Feb 84 08:17:49 PST
Date: Tue 21 Feb 84 08:15:25-PST
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: revised (final?) schedule
To: Kuipers-crew: ;
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
Visit of Ben Kuipers
23-24 February 1984
Thursday, February 23:
11:30am - 1:15pm: lunch (hosts: Larry Fagan, Derek Sleeman, and
Bob Blum); Meet in TC-135
1:15pm - 2:15pm: Ted Shortliffe (TC-135)
2:30pm - 3:30pm: Tom Rindfleisch (701 Welch Road)
3:30pm - 4:15pm: Peter Friedland (701 Welch Road)
4:15pm - 4:45pm: Russ Greiner (will walk him over to MJH from
Welch Road)
4:45pm - 5:45pm: Mike Genesereth (MJH)
5:45pm - 6:30pm: free time
6:30pm: dinner (Genesereth will bring Kuipers)
Faculty Club
Friday, February 24:
8:30am - 9:30am: Bruce Buchanan (701 Welch Road)
9:30am - 10:30am: Barbara Hayes-Roth (701 Welch Road)
10:30am - 11:30am: Bill Clancey (701 Welch Road)
11:30am - 12:00pm: free
12:00pm - 1:15pm: SIGLUNCH presentation (Gazebo)
1:15pm - 2:00pm: Ed Feigenbaum (MJH)
thereafter: free
-------
∂21-Feb-84 1913 LAMPING@SU-SCORE.ARPA Ai section of comp
Received: from SU-SCORE by SU-AI with TCP/SMTP; 21 Feb 84 19:13:34 PST
Date: Tue 21 Feb 84 19:13:25-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Ai section of comp
To: JMC@SU-AI.ARPA
I have some ideas for the outline of some questions. I'm not sure what
sort of security is appropriate for them (specifically, is it OK to put
them online). I'd like to get your opinions before working out details.
Also, when would you like Rich's book back. I am done with a first glance,
but would like to have it while I make up actual questions. (which could
mean giving it back to you and borrowing it again later).
-------
∂21-Feb-84 2111 CLT sarah
needs money - call her
∂21-Feb-84 2330 POURNE@MIT-MC don't forget
Received: from MIT-MC by SU-AI with TCP/SMTP; 21 Feb 84 23:30:22 PST
Date: 22 February 1984 02:25-EST
From: Jerry E. Pournelle <POURNE @ MIT-MC>
Subject: don't forget
To: JMC @ SU-AI
To send US Snail some instructios on using the jxp account. I
may need it to download...
also, do make that book proposal.
best regards,
JEP
Please send Jerry Pournelle Short Waits to his L.A. address.
∂22-Feb-84 1626 BUCHANAN@SUMEX-AIM.ARPA AAAI agreement with Sci.DataLink
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 22 Feb 84 16:26:05 PST
Delivery-Notice: While sending this message to SU-AI.ARPA, the
SUMEX-AIM.ARPA mailer was obliged to send this message in 50-byte
individually Pushed segments because normal TCP stream transmission
timed out. This probably indicates a problem with the receiving TCP
or SMTP server. See your site's software support if you have any questions.
Date: Wed 22 Feb 84 16:23:34-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: AAAI agreement with Sci.DataLink
To: aaai-office@SUMEX-AIM.ARPA
cc: jmc@SU-AI.ARPA
Claudia,
I just received a copy of the letter dated Feb 3 to Chia Reinhard
at Scientific DataLink. It looks fine except there is a typo in the
middle paragraph (beginning "Every new addition"):
Change last sentence to read
"Also, if the list is sold to or transfered to other
vendors and/or is used withOUT proper compensation ..."
bgb
-------
∂22-Feb-84 1710 rodrigue@LBL-CSAM Re: Industry lecturers
Received: from LBL-CSAM by SU-AI with TCP/SMTP; 22 Feb 84 17:10:30 PST
Return-Path: <rodrigue@LBL-CSAM>
Received: by lbl-csam.ARPA ; Wed, 22 Feb 84 17:13:03 pst
Date: Wed, 22 Feb 84 17:13:03 pst
From: (Garry Rodrigue [ams/llnl]) rodrigue@LBL-CSAM
Message-Id: <8402230113.AA20859@lbl-csam.ARPA>
To: JMC@SU-AI, faculty@SU-SCORE
Subject: Re: Industry lecturers
∂22-Feb-84 1740 HALPERN.SJRLVM1%IBM-SJ@Csnet-Relay knowledge seminar, once more with feeling
Received: from SU-HNV by SU-AI with TCP/SMTP; 22 Feb 84 17:40:45 PST
Received: from rand-relay.ARPA by Diablo with TCP; Wed, 22 Feb 84 17:34:40 pst
Date: 22 Feb 1984 11:38:40-PST (Wednesday)
From: Joe Halpern <HALPERN%IBM-SJ@Csnet-Relay>
Return-Path: <HALPERN.SJRLVM1%IBM-SJ@Csnet-Relay>
Subject: knowledge seminar, once more with feeling
To: KNOWLEDGE@SU-HNV
Via: IBM-SJ; 22 Feb 84 13:15-PST
The Diablo mailer at Stanford was extremely flaky last week. As a
result, a number of people didn't get the announcement of this Friday's
knowledge seminar, while others got many copies of bad messages. I
am sending out the announcement again, in the hopes that it will
work better this time, and come in time to be of use.
The knowledge seminar will be continuing as scheduled on Feb. 24,
at 10 AM. Our speakers will be Kurt Konolige of SRI and Yoram Moses
of Stanford. The abstracts are included below. Our speaker for
March 9 will be Bob Moore of SRI and Hector Levesque of Fairchild.
See you then.
A Deduction Model of Belief -- Kurt Konolige
Most current formal models of belief for AI planning systems are
derivatives of a possible-world semantics for belief. However, this
model suffers from epistemological and heuristic inadequacies.
Epistemologically, it assumes that agents know all the consequences of
their belief. This assumption is clearly inaccurate, because it
doesn't take into account resource limitations on an agent's reasoning
ability. For example, if an agent knows the rules of chess, it then
follows in the possible-world model that he knows whether white has a
winning strategy or not. On the heuristic side, proposed mechanical
deduction procedures have been first-order axiomatizations of the
possible-world semantics, an indirect and inefficient method of
reasoning about belief.
A more natural model of belief is a deduction model: an agent has a
set of initial beliefs about the world in some internal language, and
a deduction process for deriving some (but not necessarily all)
logical consequences of these beliefs. Within this model, it is
possible to account for resource limitations of an agent's deduction
process; for example, one can model a situation in which an agent
knows the rules of chess but does not have the computational resources
to search the complete game tree before making a move.
This talk will be about the deduction model of belief and its
formalization by modal logic families. I will discuss some of the
following issues:
1. the correspondence between the deduction and possible
world model;
2. a theory of ignorance;
3. a theory of introspection.
A formalization of the Wise Man Puzzle and a derivative, the
not-so-wise-man problem, will also be given.
Knowledge and Common Knowledge In Distributed Systems -- Yoram Moses
The notion of knowledge in a distributed environment is fundamental to many
issues in distributed computing. Many tasks in a distributed system
directly involve the achievement of specific states of knowledge and others
crucially depend on a variety of constraints on the state of knowledge of
the parties involved. Communication in a distributed system can be viewed
(and in some cases should be viewed) as the act of transforming the system's
state of knowledge. Of particular importance is the notion of Common Knowledge,
which can be viewed as the generalization of an individual's knowledge to a
group. Common knowledge is inherent in notions such as agreement.
We investigate the conditions needed to achieve common knowledge of a fact in a
distributed system, showing that there are practical problems in achieving it
in actual systems. We present a new related notion, called epsilon common
knowledge that corresponds to the knowledge state achievable in some reasonable
systems. We show how this notion can be incorporated into a logic of knowledge,
and compare it with common knowledge. We discuss the logical and practical
implications of this to actual knowledge and action in distributed environmemts.
This work is joint with Joe Halpern of IBM San Jose.
∂22-Feb-84 2322 HST lisp history
it might be that indeed you worked with lambda notation before lisp deve-
lopment started.j.slagle gave me very short notice he had done watching
a lecture of you in may 58.there lambda notation is mentioned in connec-
tion to function composition.
you wrote a paper "notes on the sky-blue compiler.on functions which pro-
duce more than one quantity as output" in 1957 (7/11/).the titel looks
quite similar to some ideas in the algol-connected paper of 1958.do you
have a saved copy?
what would you think were the reasons for Morse to send you in the ALGOL
group (better:ACM ad hoc committee)? as far as i know you had no published
paper at this time which proved you as programming language specialist.
There was no such thing as a programming language specialist, and I
was the faculty member with the most programming language interests,
although one of the programmers had worked in the Fortran group at
IBM. I believe I was already making propaganda for the idea of
an algebraic list processing language.
∂23-Feb-84 0849 AAAI-OFFICE@SUMEX-AIM.ARPA signature
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 23 Feb 84 08:49:32 PST
Date: Thu 23 Feb 84 08:50:03-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: signature
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Our attorney reviewed the UT letter (from the AAAI to UT) and said
it was OK to send out. It will need your signature or would you
like me to sign off for you?
Claudia
-------
aaai-office@sumex
letter to UT
Claudia,
You might as well sign it off. Are the arrangements substantially all
we want or did we substantially compromise our ability to run the
conference the way want and to use it to finance our activities?
John
∂23-Feb-84 0900 JMC*
Brian Reid
∂23-Feb-84 1523 DFH France air reservations
The schedule looks like this:
Sun Mar.25 PA 72 SFO/JFK 9am/5:10pm
PA 114 JFK/Orly 6:45pm/8:35am +1
Sat Mar.31 PA 115 Orly/JFK 2:00pm/3:05pm
PA 67 JFK/SFO 4:30pm/7:22pm
The only special fare available for this length of stay
is the APEX fare, $999 round trip. It requires purchasing
the ticket 21 days in advance, 7 day minimum (60 day maximum)
stay, and a cancellation charge if you change or cancel a flight.
(The amount wasn't stated, guess was $25 -$50). The regular
coach fare is $2170. If you want to use the APEX, the ticketing
deadline would be Mar.2 or so. I have not made these reservations.
∂23-Feb-84 1754 GROSOF@SUMEX-AIM.ARPA invitation to speak at CS229b
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 23 Feb 84 17:54:20 PST
Date: Thu 23 Feb 84 17:54:48-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: invitation to speak at CS229b
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA
Hi John,
The discussion session I invited you to be guest for is Thursday,
March 15, 9:30-11:30am, in MJ 352. CS229b is a course oriented to qual
preparation. It consists of reading, student-only discussion sessions on
Tuesdays (9:30-12), and discussions with a guest on Thursdays (9:30-11:30).
The course is organized around one topic per week. Our last week is,
however, miscellaneous, which we have decided to devote to issues of:
supercomputer architecture for AI
programming languages for AI
evaluating AI systems
The class has expressed desire to have you be our guest to discuss these and
your general thoughts on AI.
Our format with guest discussions is informal, basically question-and-answer.
Please feel no responsibility to prepare anything. If you'd like to make
some opening remarks for say half an hour, that's fine.
Please let me know if you'll be able to come, as soon as you can.
----------------------
I really enjoyed getting the opportunity to talk with you at length this
afternoon. I'm quite busy these days what with qual, probabilities, and
programming project, but I will keep thinking about circumscription and
nonmonotonicity.
Benjamin
-------
∂23-Feb-84 2001 JMC*
Etherington
∂23-Feb-84 2145 PACK@SU-SCORE.ARPA hierarchy notes
Received: from SU-SCORE by SU-AI with TCP/SMTP; 23 Feb 84 21:45:06 PST
Date: Thu 23 Feb 84 21:44:55-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: hierarchy notes
To: jmc@SU-AI.ARPA
The last sentence is incomplete, and I can't remember what you meant
by it.
-------
∂23-Feb-84 2304 HST LISP HISTORY
WHAT DOES THAT MEAN "HAD WORKED IN THE FORTRAN GROUP AT IBM"?
YOU TOLD ME ONLY THAT YOU HAD A VERY DISTANT CONSULTATION JOB (TO NAT
ROCHESTERS GROUP).
hst
Lisp history
It wasn't I who had worked in the Fortran group; it was Sheldon
Best at the M.I.T. Computation Center. I mentioned him only in
connection with the question of whether Morse had any alternatives
to me as far as the Algol Committee was concerned. It still seems
that he didn't, and it may even be that the letter to Morse was
a formality, because I believe I had previously talked about various
ideas at a U. Michigan summer school that Carr ran.
∂24-Feb-84 1001 JMC*
industrial, expense, reid, reddy
∂24-Feb-84 1004 @MIT-MC:DAM@MIT-OZ Visit
Received: from SU-HNV by SU-AI with TCP/SMTP; 24 Feb 84 10:04:04 PST
Received: from MIT-MC by Diablo with TCP; Fri, 24 Feb 84 09:59:45 pst
Date: Fri, 24 Feb 1984 12:58 EST
Message-Id: <DAM.11994332836.BABYL@MIT-OZ>
From: DAM%MIT-OZ@MIT-MC.ARPA
To: Joe Halpern <HALPERN%IBM-SJ@CSNET-CIC.ARPA>
Cc: KNOWLEDGE@SU-HNV.ARPA
Subject: Visit
In-Reply-To: Msg of 22 Feb 1984 14:38-EST from Joe Halpern <HALPERN%IBM-SJ at Csnet-Relay>
Hi, how are things going?
It looks like I will be in your area March 12-19. I would like
to spend some time talking to you and the people involved in your
knowledge seminar. I am currently scheduled to be at PARC monday
the 12th but other than that I think my schedule is still open.
Looking forward to seeing you,
David
∂24-Feb-84 1701 BERG@SU-SCORE.ARPA industry lectureship
Received: from SU-SCORE by SU-AI with TCP/SMTP; 24 Feb 84 17:00:56 PST
Date: Fri 24 Feb 84 17:00:07-PST
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: industry lectureship
To: jmc@SU-AI.ARPA
cc: berg@SU-SCORE.ARPA
Stanford-Phone: (415) 497-4776
Do you have additional lecturers line up for CS 400? I only have Joe Halpern's
name thus far...Let me know as soon as possible. I need to turn in
our corrected copy of Courses and Degrees to the editorial office early
next week.
Thank you for your cooperation.
Kathryn Berg
-------
∂24-Feb-84 2256 PACK@SU-SCORE.ARPA Prolog program
Received: from SU-SCORE by SU-AI with TCP/SMTP; 24 Feb 84 22:55:56 PST
Date: Fri 24 Feb 84 22:55:44-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Prolog program
To: jmc@SU-AI.ARPA
If you tried adding the new rule the way I initially wrote it, it
won't work. I have a corrected version on isajmc.pl[1,lep]. The rule
should read:
ordinarily(C,not-(not-P)) :-
ordinarily(C,P).
I forgot it introduced the parenthises.
-------
∂24-Feb-84 2336 HST lisp history
ok.i understood my mistake already if i inspected your message more carfully.
i wrote a letter to carr - i had a talk with bauer and he suggested that.
do you believe that there could be any record of this summer school (summer
1957)?
do have the ai-memo1 or should i send a copy to you?
another thing:do accept the view that there was a shift in the paradigm of
ai at the end of the sixties/begin of the seventies?
(for my feeling its rather a shift in the examples.)
do you count macsyma as ai program?
∂26-Feb-84 2349 LLW@S1-A Shackleton, Etc.
Received: from S1-A by SU-AI with TCP/SMTP; 26 Feb 84 23:49:19 PST
Date: 26 Feb 84 2346 PST
From: Lowell Wood <LLW@S1-A>
Subject: Shackleton, Etc.
To: jmc@SU-AI
CC: LLW@S1-A
∂23-Feb-84 0059 JMC@SU-AI Shackleton paper
Received: from SU-AI by S1-A with TCP/SMTP; 23 Feb 84 00:59:07 PST
Date: 23 Feb 84 0103 PST
From: John McCarthy <JMC@SU-AI>
Subject: Shackleton paper
To: llw@S1-A, rah@S1-A
Jerry Pournelle wants me (or us) to give a talk on it at the L-5
sponsored Space Industrialization Conference in SF. I think it's
a good idea, but I want to discuss it with you first.
[John: Sounds reasonable. I'll be leading a Arms Control Prayer Meeting
at Terman Auditorium at 8 PM tomorrow (Monday) evening. Would you care to
chat briefly, either before or after, somewhere convenient for you around
campus? Lowell]
chat
Sure, let's get together. If you're free for dinner we can do that.
Otherwise, or also, let's talk afterwards. I'll see you there in any
case.
rah%s1
shackleton
As I think I mentioned in a previous message, Pournelle wants a talk
on Shackleton at the San Francisco Space Industrialization Conference.
I have discussed it with Lowell, and he is agreeable to going ahead
with this. Are you also?
∂27-Feb-84 0811 AAAI-OFFICE@SUMEX-AIM.ARPA Re: letter to UT
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 27 Feb 84 08:11:33 PST
Date: Mon 27 Feb 84 08:11:06-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Re: letter to UT
To: JMC@SU-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 23 Feb 84 09:49:00-PST
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Our current arrangements are substantially the same as in other years';
however, the registration is now off campus, which is a compromise from
our original plan. There are some real advantages with having the
registration off campus, i.e. we can now sell extra proceedings, memberships,
and magazines whereas at the university, it would have been a problem.
Also, with the revised building use agreement (which eliminated the
sections on the return of excess funds to UT and extra fee charges),
our only financial responsibilities to UT is the payment of direct
services (ie electricians, guards) which was anticipated.
That's it for now.
Claudia
-------
∂27-Feb-84 0829 DFH While I'm away
To: "@GROUP.[1,DFH]"
I'll be away 2/28-3/5. If you need to mail anything, stamps are in lower
left hand drawer of my desk. There is one envelope for JMC people, one for
ZM people, so please use the appropriate one. Thanks, Diana.
∂27-Feb-84 1011 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- MARCH 2, 1984
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 27 Feb 84 10:11:04 PST
Date: Mon 27 Feb 84 09:26:59-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -- MARCH 2, 1984
To: siglunch@SUMEX-AIM.ARPA
PLEASE NOTE---CHANGE IN LOCATION FOR THIS FRIDAY ONLY --- MARCH 2, 1984.
will be held at:
ENGLISH Building (Bldg. 50), Room 51-B
--------------------------------------------------------------------------
SIGLUNCH
Friday, March 2, 1984
LOCATION: English Building (Bldg. 50), Room 51-b
12:05
SPEAKER: Tom Mitchell
Rutgers University
TOPIC: Learning and Problem Solving
ABSTRACT:
One mark of intelligence is the ability to improve one's
problem-solving abilities through experience. Modelling this kind of
learning is an important goal for AI, both because it is bound to lead
to general insights on the nature of intelligence, and because of its
practical importance for developing high-performance problem solving
programs. We discuss some recent progress in the area of learning
problem-solving expertise, as well as some directions in which
research in this area is headed.
-------
∂27-Feb-84 1022 DFH phone C. Mazzetti
∂27-Feb-84 1031 BSCOTT@SU-SCORE.ARPA Umbrella Contract
Received: from SU-SCORE by SU-AI with TCP/SMTP; 27 Feb 84 10:31:16 PST
Date: Mon 27 Feb 84 10:21:27-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Umbrella Contract
To: JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, DCL@SU-AI.ARPA, DEK@SU-AI.ARPA,
ZM@SU-AI.ARPA, Wiederhold@SUMEX-AIM.ARPA
cc: MAS@SU-AI.ARPA, RBA@SU-AI.ARPA, DFH@SU-AI.ARPA, Atkinson@SU-SCORE.ARPA,
BScott@SU-SCORE.ARPA
We have received a preliminary umbrella contract in the amount of
$12,482,047. This is $997,50l short of the umbrella proposal. These
figures include indirect costs.
The tasks for all six of you total $6,969,821. The major cut is in
the salaries proposed; the cut is a combination of position elimination
and a reduction from 8% to 6% in salary increases over the three years.
You will recall that we included positions and expenses to allow for
additional tasks over the three year period. The question now is whether
the $5,512,226 (including indirect costs) will be sufficient to add tasks
over the three years.
Another question to be resolved is how the $697,000 addition to the current
contract fits into the picture, i.e., whether it is to be deducted from
the $12,482,047 proposed award on the new contract. I am trying to confirm
exactly how this is to be handled, and will let you know as soon as I have
the answer.
I do not know whether specific tasks have been cut in the overall award
reduction, since we only have the "lump" sum figure. I am working with SPO
now to try and get this additional detail.
I will appreciate your comments on the information I have to date, and I
will certainly keep you informed of any new information received.
Please keep in mind that we don't have an effective contract date; this won't
be assigned until the contract has been approved both by Stanford and by
Navelex.
Betty
-------
∂27-Feb-84 1158 HOLTZMAN@SUMEX-AIM.ARPA MEU
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 27 Feb 84 11:58:42 PST
Date: Mon 27 Feb 84 11:58:08-PST
From: Samuel Holtzman <HOLTZMAN@SUMEX-AIM.ARPA>
Subject: MEU
To: jmc@SU-AI.ARPA
cc: holtZMAN@SUMEX-AIM.ARPA
Dear Professor McCarthy:
Thanks for your comments on "ought" rules. Your opinion is very useful
to me since your perspective is different from that of most of my
colleagues. In particular your argument against a unitary ought rule
has made me rethink my position regarding Maximum Expected Utility
(MEU).
I certainly do not claim that MEU is a good descriptor of human
behavior except, perhaps, in trivial situations. In contrast, I feel
that the normative power of the rule is remarkable. The context in
which I mean this, however, requires some explanation. I will address
mostly the use of MEU for prescribing human action.
The problem that interests me is the situation encountered by people
who are faced with a decision for which they have no strong
heuristics. That is, when people are "stuck" with a decision. Two
brute-force approaches to this problem are a) to provide a
recommendation for action by solving a decision theoretic
representation of their problem and b) to give them access to an
expert system which can increase their domain knowledge in hopes of
promoting the development of the needed heuristics. However,
paraphrasing Herb Simon, people do not commit valuable resources
solely as a consequence of a logical argument, regardless of its
correctness. To really help people who are stuck with a decision
problem we must give them insight.
If our purpose is to develop insight, rather than to compute answers,
it is very useful to have a formal method in which to describe
assumptions and infer their consequences. MEU works wonders in this
context. Note that I am not saying that this, or any other rule is
what people should obey to make "good" decisions. What I am claiming
is that the EFFORT needed to formalize a problem can often get people
UNSTUCK (I have seen this happen repeatedly when I wear my consultant
hat). MEU's desirability does not come from its uniqueness -- it is
certainly not a panacea -- but from the fact that it is the best
formalization of decision making behavior I know of (Savage and
DeFinetti did a pretty good convincing job). It is important to
realize that I am not even basing my argument on the success of the
effort to formalize a decision problem; all that is required is that
the decision maker give it a good try. It is interesting to note in
this context that a good indicator of a successful decision analysis
is the fact that no final report is written: no one needs to be
convinced of what should be done!
Let me now address you specific comments regarding prescriptive rules.
In your note you made two crucial points:
1. "We can only formulate rules governing small (in some
sense) models of certain aspects of the world."
2. "Suppose that we have a certain parametrized set of
circumstances, and suppose that the prescriptions of the set
of rules are unambiguous and intuitively satisfactory in these
circumstances. Suppose now that we propose to expand the
collection of circumstances considered. It may happen that
the rules become ambiguous or that the results are intuitively
unsatisfactory. Is there necessarily a more comprehensive
rule that will give even approximately the same results in the
limited circumstances, which can be compactly formulated and
which is intuitively satisfactory. My opinion is that this is
not guaranteed."
I fully agree with both points, and not just in terms of MEU, but for
any formal decision making method. In my dissertation I claim that
for a formal method to be valid in the context of a given real
situation, it must meet two conditions that are closely related to
your two points: local correctness, and structural regularity. The
former condition implies that the formal method should give
intuitively correct answers "in the small," the latter is a requirement
that the domain be such that the normative method remains applicable
as problems within it increase in size and complexity. I claim that
MEU is locally correct, and that the domain of personal decision
making is structurally regular with respect to the MEU axiom.
A final advantage of a unique action axiom: simplicity. Although I
recognize the possibility that a multiple "ought" rule systems might
provide attractive alternatives to MEU (I am aware of very good work
in this direction), there is certain beauty in a single-axiom
formalization. In particular, there is no need for an arbiter -- a
possibly messy issue.
One last comment regarding the use of MEU for automated decision
making: I DO NOT THINK THAT AUTOMATED DECISION MAKING IS A GOOD IDEA
unless a) the resources involved are small (e.g., automatic
manufacturing, file manipulation), or b) there is an explicit
advantage to delegating authority (e.g., deep space probes,
quick-response real time systems). Neither case concerns me very
much; heuristic systems may well be an efficient solution. In
general, however, I worry. As you are well aware, the use of
automatic decision systems in contexts such as defense, and medicine
is very possible in the foreseeable future. One advantage of MEU is
that it makes the surrogate decision maker's VALUES very EXPLICIT.
Multiple ought-rule systems are likely not to share this feature. The
last thing I want to see is an automated politician with a direct
means to remove my kidneys, or explode a bomb.
Again, let me thank you for your comments. They have been very
helpful to me in clarifying my ideas.
Regards,
Sam Holtzman
-------
∂27-Feb-84 1202 JK
To: "@SATO.DIS[1,CLT]"
I have sent Sato a preliminary version of the proposal.
Diane is preparing a budget for it --
it requests funds for two two-week long trips to Japan for each of us.
∂27-Feb-84 1645 DFH
France/air reservations
There are some problems using the APEX fare.
1. You had to stay one more day to qualify, which means returning
Sunday, April 1.
2. There were no APEX seats available on 4/1 from Orly to JFK,
so I used the London routing. Fare is still $999 RT.
3. Ticketing deadline is Mar. 3, which is a Saturday, so you may want
to get them done Friday, Mar. 2. Cancellation or changes after
ticketing bring a $50 penalty, plus you would not qualify for the
fare. Coach fare is $1878 RT.
4. These reservations were made directly with Pan Am, 364-1921.
Reservations are currently as follows:
Sun 3/25 SFO/JFK PA72 9am/5:10pm
JFK/Orly PA114 6:45pm/8:35am+1
Sun 4/1 DeGaualle/London BA305 11:30am/11:30am (time zone change)
London/SFO PA125 2:00pm/3:45pm
∂28-Feb-84 0116 reiter%ubc%ubc@Rand-Relay your requests
Received: from CSNET2 by SU-AI with TCP/SMTP; 28 Feb 84 01:16:15 PST
Date: Mon, 27 Feb 84 21:57:47 pst
From: Ray Reiter <reiter%ubc@Rand-Relay>
Return-Path: <reiter%ubc%ubc@Rand-Relay>
Subject: your requests
Message-Id: <8402280557.AA01033@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA01033; Mon, 27 Feb 84 21:57:47 pst
To: JMC@SU-AI
Via: ubc; 28 Feb 84 0:07-PST
Dear John
Thanks for your message. My phone nos. are (604)228-4142 (office), (604)685-
3825 (home).
Re a visit to Stanford in April or May: Sounds good. Only problem is I'll be
travelling a lot around then and I don't yet have a schedule worked out. Can
I get back to you on it? I would prefer to arrive on a Thurs. and spend Fri.
there. Would that be OK. I assume that you'd want me to give a talk to your
seminar. Would my Brooklyn talk be OK? Embellished by some recent work on
1. Some database problems that make use of your unpublished generalized
circumscription.
2. Joint circumscription and a generalization of Clark's results on the seman-
tics of negation in PROLOG.
How do you do unique names? I have a student who claims to have a proof that
it can't be done circumscriptively, although I haven't seen the proof yet.
Best wishes, Ray.
∂28-Feb-84 0750 ARK Party
To: "@PARTY.DIS[1,ARK]"@SU-AI, SU-BBoards@SU-AI
It is about time for us to have another party! Come help us celebrate it.
We have a complete set of hosts and hostesses for this event, namely
Arthur Keller, Joe Weening, Maureen Tjan, and Noriko Minaka, and Richard
Boly. This gala event will be on Friday, 2 March from 8 p.m. until dawn
at 3400 Kenneth Drive, Palo Alto (856-3550), off Greer near Loma Verde.
Maps will be by the receptionist's desk in MJH.
Come prepared for some serious carousing. Please don't feel inhibited
about bringing your favorite consumables.
Arthur Keller
∂28-Feb-84 1354 ME ap
∂28-Feb-84 1333 JMC
I don't like to bother you redundantly. Do you usually know about AP?
ME - No. Feel free to bring it to my attention in cases like this.
r cksum;msg.msg9 WALDINGER@SRI-AI.ARPA Re: course
Received: from SRI-AI by SU-AI with TCP/SMTP; 28 Feb 84 17:29:37 PST
Date: Tue 28 Feb 84 17:30:27-PST
From: WALDINGER@SRI-AI.ARPA
Subject: Re: course
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Mon 27 Feb 84 16:35:00-PST
sorry for delay in reply: i was away on a trip.
i would be interested in doing the course but autumn quarter is
not a good time. zohar and i are teaching 157a and 157b in
fall and winter quarter, respectively, and will be trying to
finish volume 2 of our book at the same time. i would not have
time to do the course either of these quarters.
also, i would expect some of the students from our cs157 classes to
be well enough prepared to take the program synthesis class if it
were offered in the spring.
the proposed salary is fine, although it is not the leading
incentive.
richard
-------
∂29-Feb-84 0859 HOLSTEGE@SU-SCORE.ARPA re: Talk: Interactive Computing & Work Stations (from SAIL's BBOARD)
Received: from SU-SCORE by SU-AI with TCP/SMTP; 29 Feb 84 08:58:53 PST
Date: Wed 29 Feb 84 08:58:59-PST
From: Mary A. Holstege <HOLSTEGE@SU-SCORE.ARPA>
Subject: re: Talk: Interactive Computing & Work Stations (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Tue 28 Feb 84 21:57:00-PST
I do not want to get into a big flame war about IBM vs DEC but your
message included some misstatements that I think ought to be corrected:
(1) the line editor may be rubbish, but the full screen editor is
very well done. Massive features dumped in an unsystematic way onto
a poorly designed base do not a super editor make, and tailorability
that requires one to be a wizard does not 'a powerful, extensible'
editor make.
(2) EXECs are not only described fully in the basic user's manual, but
one does not have to be an expert to use them. They also have the
advantage of being usable to control edits and full-screen management
easily. While there are indeed problems w/ VM and CMS, EXECs are the
one thing that other manufacturers would do well to copy. Not being
able to easily tailor one's work environment is what makes other
systems so horrendous.
-- Mary
-------
∂29-Feb-84 0952 DKANERVA@SRI-AI.ARPA
Received: from SRI-AI by SU-AI with TCP/SMTP; 29 Feb 84 09:52:36 PST
Delivery-Notice: While sending this message to SU-AI.ARPA, the
SRI-AI.ARPA mailer was obliged to send this message in 50-byte
individually Pushed segments because normal TCP stream transmission
timed out. This probably indicates a problem with the receiving TCP
or SMTP server. See your site's software support if you have any questions.
Date: Wed 29 Feb 84 09:52:30-PST
From: DKANERVA@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Tue 28 Feb 84 00:54:00-PST
I'll be glad to announce it with the abstract in the Newsletter.
-- Dianne
-------
∂29-Feb-84 1249 ME KA-10
To: JMC@SU-AI
CC: LB@SU-AI
∂29-Feb-84 1147 JMC
To: ME@SU-AI, bosack@SU-SCORE
What's the prognosis on the KA? I have lots of pub output.
ME - Since I'm sick and Len is busy, my guess is next week.
∂29-Feb-84 1435 cheriton@diablo Industrial Lecturership course
Received: from SU-HNV by SU-AI with TCP/SMTP; 29 Feb 84 14:35:51 PST
Date: Wed, 29 Feb 84 14:35 PST
From: David Cheriton <cheriton@diablo>
Subject: Industrial Lecturership course
To: jmc@su-ai
Here is the information I got from Ed Lazowska.
He wants to joint teach it with Sevcik, who will only
be available during the fall, i.e. teach it during the fall.
Seems like a real gift to me. What's the next step.
From LAZOWSKA@WASHINGTON.ARPA Tue Feb 28 21:46:51 1984
Received: from WASHINGTON.ARPA by Diablo with TCP; Tue, 28 Feb 84 21:46:39 pst
Date: Tue 28 Feb 84 21:46:15-PST
From: Ed Lazowska <LAZOWSKA@WASHINGTON.ARPA>
Subject: Stanford course
To: cheriton@SU-HNV.ARPA
Cc: owicki@SU-SCORE.ARPA, lazowska@UW-JUNE.ARPA
Status: R
David --
Here's further information on the proposed
course. Sorry for the delay; I've been on
the road for 10 days.
Title
-----
Computer System Performance Modelling
Instructors
-----------
Edward D. Lazowska (on leave from the Department
of Computer Science, University of Washington)
and Kenneth C. Sevcik (on leave from the Computer
Systems Research Group, University of Toronto).
Text
----
"Quantitative System Performance: Computer System
Analysis Using Queueing Network Models" by Edward
D. Lazowska, John Zahorjan, G. Scott Graham, and
Kenneth C. Sevcik, Prentice-Hall, 1984.
Catalog Description
-------------------
The use of queueing network performance models as
tools in the design and analysis of computer systems.
Topics include Little's law and other fundamental
relations, bounding the performance of systems,
algorithms for evaluating queueing network models,
flow equivalence and hierarchical modelling, detailed
representation of specific subsystems, parameterization
of models, the structure and use of queueing network
modelling software. Various exercises, one examination,
and a realistic case study.
Course Schedule
---------------
Two 1.5-hour meetings per week, at either the beginning
or the end of the day. Fall Q, so that Sevcik can
participate; there's a good chance he'll be in Europe
during Winter and Spring Q.
Support Requirements
--------------------
Ideally, two computing facilities. The first would be
a 370 running VM/370. (That's what commercial-grade
queueing network modelling software runs on; sorry.)
The second would be a more hospitable environment
for student exercises, done in Pascal or some similar
language.
Do you need to know more?
-------
cheriton@diablo
Lazowska
It looks like it would be a good course, but the three slots are
now filled. Perhaps the faculty could decide that yet one more
such course would be a good idea.
∂29-Feb-84 1905 Ellis.pa@PARC-MAXC.ARPA Re: course
Received: from PARC-MAXC by SU-AI with TCP/SMTP; 29 Feb 84 19:05:43 PST
Date: 29 Feb 84 19:05:33 PST (Wednesday)
From: Ellis.pa@PARC-MAXC.ARPA
Subject: Re: course
In-reply-to: Your message of 29 Feb 84 15:09 PST
To: John McCarthy <JMC@SU-AI.ARPA>
cc: ellis.pa@PARC-MAXC.ARPA
Yes thanks, I would be delighted to teach the office information systems
course in the fall. I'm glad that you could switch it from the winter to
the fall quarter. Does an office at Stanford go along with the teaching,
since I will not have an office at Xerox?
Clarence (Skip) Ellis
ellis.pa%parc-maxc
office
I don't know whether we have provided office space for this year's
industrial lecturers. I understand you will be on sabbatical here,
and I suggest you talk to whoever arranged that.
∂01-Mar-84 0236 YOM
To: JMC, ZM
please remember to write the recommendation . I can take it to
It is written.
∂01-Mar-84 0239 YOM (on TTY23 0239)
continued... Caolyn Tajnai if you like. Thanks, Yoram.
∂01-Mar-84 0918 BERG@SU-SCORE.ARPA CS400
Received: from SU-SCORE by SU-AI with TCP/SMTP; 1 Mar 84 09:18:14 PST
Date: Thu 1 Mar 84 09:18:20-PST
"halpern.ibm-sj"@rand-relay
for your information
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: CS400
To: JMC@SU-AI.ARPA
Stanford-Phone: (415) 497-4776
I had to change some of the wording Prof. Halpern used in his course
description. The editorial office does not permit one to use
phrases like "We will discuss....", so I amended these sentences.
Here is the description as it will read in Courses and Degrees.
400B Reasoning about Knowledge. Formal Systems for modeling aspects
of reasoning about knowledge, such as modal logic, nonmonotonic logic and
relevance logic will be considered. Discussions will address to what
extent these approaches can be used to deal with such problems as
reasoning in the presence of inconsistency, belief revision, and
knowledge representation. Familiarity with mathematical reasoning and
first-order logic will be assumed.
Winter quarter (Halpern) by arrangement.
Hope this is satisfactory. Also, as it now stands, Ellis will lecture
autumn, Halpern in winter, and Waldinger in spring.
Kathy
-------
∂01-Mar-84 1023 SJG
John -
Are any of the following worth thinking about?
a. 1. Birds fly (true by default).
2. Ostriches do not fly (true absolutely).
Now derive that birds are not ostriches (true by default)
b. 1. Birds fly (true by default).
2. Ostriches do not fly (true by default).
Now fail to derive that birds are not ostriches (by default).
c. 1. Birds fly (true by default).
2. Ostriches do not fly (true by default).
3. Ostriches are birds (true by default).
Now derive that birds are not ostriches (by default).
See you for Hayes' talk, I assume.
Matt
∂01-Mar-84 1145 BERG@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 1 Mar 84 11:45:09 PST
Date: Thu 1 Mar 84 11:45:08-PST
From: Kathy Berg <BERG@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Thu 1 Mar 84 10:00:00-PST
Stanford-Phone: (415) 497-4776
Sorry. You are correct. I have rearranged the scheduling so Halpern
will teach winter.
kathy
-------
∂01-Mar-84 1220 100 (from: mlb@mc) may Gosper use your Dover?
To: JMC, RWG
As you probably know, Gosper is slated to present a paper at the Courant
Computer Algebra conference at which you will be a panelist.
Unfortunately, someone at Symbolics in Cambridge messed up our TeX files.
We've found another way to run TeX, the problem is getting hardcopies of
the drafts of his manuscript.
Can Gosper have permission to use your Dover for this purpose for the
next month?
Someone seems to have flushed my SAIL account, so could you let me know
either by calling Symbolics (494-8081) or perhaps passing the word through
RPG or PW, with whom we are in frequent contact?
Thanks!
Marc Le Brun
aka MLB%SCRC@MC
nee MLB@SAIL
∂01-Mar-84 1347 CL.BOYER@UTEXAS-20.ARPA Lisp Conference Conflict
Received: from UTEXAS-20 by SU-AI with TCP/SMTP; 1 Mar 84 13:46:50 PST
Date: Thu 1 Mar 84 15:48:29-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Lisp Conference Conflict
To: jmc@SU-AI.ARPA
It seems as though you'll be faced with some kind of
conflict on the evening of August 7, a Tuesday. The Lisp
Conference banquet will be that night, but I've also heard
that a meeting of the AAAI executive committee has been
scheduled. It will be disappointing if you can't make the
banquet, but that's what I get for scheduling the Lisp
Conference near AAAI.
Guy said he got over 100 papers for 25 slots, so there's a
chance we'll have some good presentations.
You may have heard that E.W. Dijkstra has accepted a chair
here. What's happened to the idea of a visit by you and
Carolyn? I also assume you've heard that Woody is going to
be VP for AI at MCC.
-------
∂01-Mar-84 1350 HALPERN.SJRLVM1@csnet-relay.arpa Knowledge seminar at IBM on Mar. 9, with Bob Moore and Hector Levesque
Received: from SU-HNV by SU-AI with TCP/SMTP; 1 Mar 84 13:49:11 PST
Received: from csnet-relay by Diablo with TCP; Thu, 1 Mar 84 13:46:58 pst
Received: by csnet-relay via xibm-sj; 1 Mar 84 16:27 EST
Date: 1 Mar 1984 12:13:57-PST (Thursday)
From: Joe Halpern <HALPERN%ibm-sj.csnet@csnet-relay.arpa>
To: knowledge%su-hnv.arpa@csnet-relay.ARPA
Subject: Knowledge seminar at IBM on Mar. 9, with Bob Moore and Hector Levesque
Cc: konrad%ucsc.csnet@csnet-relay.ARPA
The knowledge seminar at IBM will continue on Mar. 9, with talks by
Bob Moore and Hector Levesque. As usual, we will meet in the main
auditorium of Building 28, at 10 AM. I've appended the abstracts
of the talks below. The following knowledge seminar will be Mar. 23,
when our speakers will be Lotfi Zadeh and Ron Fagin.
SEMANTICAL CONSIDERATIONS ON NONMONOTONIC LOGIC-- Bob Moore, SRI
Commonsense reasoning is "nonmonotonic" in the sense that we often
draw, on the basis of partial information, conclusions that we later
retract when we are given more complete information. Some of the most
interesting products of recent attempts to formalize nonmonotonic
reasoning are the nonmonotonic logics of McDermott and Doyle
(McDermott and Doyle, 1980; McDermott, 1982). These logics, however,
all have peculiarities that suggest they do not quite succeed in
capturing the intuitions that prompted their development. In this
talk we reconstruct nonmonotonic logic as a model of an ideally
rational agent's reasoning about his own beliefs. For the resulting
system, called "autoepistemic logic," we define an intuitively based
semantics for which we can show autoepistemic logic to be both sound
and complete. We then compare autoepistemic logic with the approach
of McDermott and Doyle, showing how it avoids the peculiarities of
their nonmonotonic logic.
-------
A Logic of Knowledge and Active Belief-- Hector J. Levesque, Fairchild Labs
As part of an on-going project to understand the foundations of Knowledge
Representation, we are attempting to characterize a sense of knowledge
that forms a more appropriate basis for Knowledge Representation systems
than that captured by the usual possible-world formalizations (begun by
Hintikka). In this talk, we will point out deficiencies in the current
semantic treatment of knowlege including the recent syntactic approaches
and suggest a new analysis (in the form of a logic of knowledge and
belief) that avoids some of these difficulties.
-------
∂01-Mar-84 1702 SHARON@SU-SCORE.ARPA phone msg
Received: from SU-SCORE by SU-AI with TCP/SMTP; 1 Mar 84 17:02:29 PST
Date: Thu 1 Mar 84 17:02:33-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
Subject: phone msg
To: mccarthy@SU-SCORE.ARPA
Barbara Glynn called. PLease call her at 321-1081.
Sharon
-------
∂01-Mar-84 2315 HST circumscription
wolfgang bibel asks for your ijcai paper on circumscruption.can you send
it by mail?
The discussion of circumscription included in my 1977 IJCAI paper
(not using the term, I think) was obsoleted by my 1980 paper.
Is this what he wants; it was called "Epistemological problems
of AI".
∂02-Mar-84 0935 SHARON@SU-SCORE.ARPA phone msg
Received: from SU-SCORE by SU-AI with TCP/SMTP; 2 Mar 84 09:35:28 PST
Date: Fri 2 Mar 84 09:35:35-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
Subject: phone msg
To: mccarthy@SU-SCORE.ARPA
Holly Murray from KCSM TV called. Call her at 574-6233.
(Important.) Sharon
-------
∂02-Mar-84 0937 SHARON@SU-SCORE.ARPA phone msg
Received: from SU-SCORE by SU-AI with TCP/SMTP; 2 Mar 84 09:37:23 PST
Date: Fri 2 Mar 84 09:36:52-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
Subject: phone msg
To: mccarthy@SU-SCORE.ARPA
Barbara Glenn called. She has someone who wants to make an appointment
with you for next week. Please call her at 321-1081.
Sharon
-------
∂02-Mar-84 1158 CLT
where does your class meet?
∂02-Mar-84 1355 SHARON@SU-SCORE.ARPA phone msgj
Received: from SU-SCORE by SU-AI with TCP/SMTP; 2 Mar 84 13:55:18 PST
Date: Fri 2 Mar 84 13:43:28-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
Subject: phone msgj
To: mccarthy@SU-SCORE.ARPA
Veronica Dahl called. Please call her at 606/272-1400.
Sharon
-------
Monday April 30 or May 1, or March 19
Logic Grammars
Would there be any interest at SRI in helping pay travel for a visit
by Veronica Dahl, probably around the end of March? She would be
coming from Kentucky.
∂02-Mar-84 1540 PEREIRA@SRI-AI.ARPA
Received: from SRI-AI by SU-AI with TCP/SMTP; 2 Mar 84 15:40:42 PST
Delivery-Notice: While sending this message to SU-AI.ARPA, the
SRI-AI.ARPA mailer was obliged to send this message in 50-byte
individually Pushed segments because normal TCP stream transmission
timed out. This probably indicates a problem with the receiving TCP
or SMTP server. See your site's software support if you have any questions.
Date: Fri 2 Mar 84 15:42:02-PST
From: PEREIRA@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Fri 2 Mar 84 14:43:00-PST
I think so, let me check the various budgets. How much do you think
is needed? -- Fernando
-------
pereira%sri-ai
Veronica Dahl
1/3 to 1/2 of the airfare and a couple nights lodging plus whatever
honorarium you customarily give if she gives a talk at SRI.
∂02-Mar-84 1722 SHARON@SU-SCORE.ARPA phone msg
Received: from SU-SCORE by SU-AI with TCP/SMTP; 2 Mar 84 17:22:30 PST
Date: Fri 2 Mar 84 17:10:31-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
Subject: phone msg
To: mccarthy@SU-SCORE.ARPA
David called from New York. Please call him at 212/864-5320.
Sharon
-------
∂03-Mar-84 1327 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE by SU-AI with TCP/SMTP; 3 Mar 84 13:27:36 PST
Date: Sat 3 Mar 84 13:27:42-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Fri 2 Mar 84 22:42:00-PST
cwr - thank you. I did not receive the initial address info.
-------
∂03-Mar-84 1653 FEIGENBAUM@SUMEX-AIM.ARPA [Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>: Psych courses -- cross listing with CS]
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 3 Mar 84 16:51:20 PST
Date: Sat 3 Mar 84 16:50:47-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>: Psych courses -- cross listing with CS]
To: jmc@SU-AI.ARPA
YOUR ADDRESS IS MISSPELLED, SO YOU MAY NOT HAVE GOTTEN THIS....ED
---------------
Mail-From: BUCHANAN created at 29-Feb-84 09:31:28
Date: Wed 29 Feb 84 09:31:28-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Psych courses -- cross listing with CS
To: feigenbaum@SUMEX-AIM.ARPA, mjc@SU-AI.ARPA, winograd@SU-SCORE.ARPA,
tob@SU-AI.ARPA, lenat@SUMEX-AIM.ARPA, genesereth@SU-SCORE.ARPA
cc: bgb@SUMEX-AIM.ARPA
Kathy Berg needs to know this week if we have any objection to cross listing
three Psych courses as CS courses in the AI series:
Psych 187 - Computational Models of Cognition (Pavel & Gluck)
Psych 286 - Survey of Applied Psych. (Pavel)
Psych 289A - Adv.Seminar in Appl.Psych (Pavel)
If you have substantial reservations, reply to the whole list. Otherwise,
I'll assume there is no discussion.
bgb
-------
-------
tob@SU-AI,lenat@SUMEX-AIM,genesereth@SU-SCORE,bgb@SUMEX-AIM,feigenbaum%sumex
cross-listing
I agree with Ed.
bgb@sumex,feigenbaum@sumex
Rod Brooks
should be included in discussions involving AI faculty
∂03-Mar-84 1653 FEIGENBAUM@SUMEX-AIM.ARPA Re: Psych courses -- cross listing with CS
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 3 Mar 84 16:53:11 PST
Date: Sat 3 Mar 84 16:52:34-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: Psych courses -- cross listing with CS
To: BUCHANAN@SUMEX-AIM.ARPA, mjc@SU-AI.ARPA, winograd@SU-SCORE.ARPA,
tob@SU-AI.ARPA, lenat@SUMEX-AIM.ARPA, genesereth@SU-SCORE.ARPA
cc: bgb@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
In-Reply-To: Message from "Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>" of Wed 29 Feb 84 09:31:31-PST
Idont think we ought to take a casual view of crosslisting, since it may confuse
students, confuse transcrpits, and confuse the outside world. I think we ought
to see the course descriptions and/or outlines before agreeing. The Psych187
might be OK, the other two may not be very reasonable.
Ed
-------
∂03-Mar-84 1649 MDD
Virginia says thank you. She will be in touch
by telephone. On the 12th I will have angioplasty
performed. This is the technique by which placques in blood
vessals (coronary arteries in my case) are compressed by inflating
a balloon. They will be using a rather new catheter which allegedly
can get the balloon into tight spaces and around corners in a way
not previously possible. Angioplasty is done under sedation, but there
is no anaesthesia needed, and if all goes as expected, I'll
leave the hospital on the 13th. Thanks again and hi to Carolyn.
-Martin
∂04-Mar-84 0900 JMC*
chud kreisel, woody
∂04-Mar-84 1749 VAL
Please read unh[1,val]. - Vladimir
∂04-Mar-84 2119 CLT
I can't find anything under m,l or v for you
OK, thanks. The dover was said to have broken just after. Is it
up now?
∂05-Mar-84 0917 BUCHANAN@SUMEX-AIM.ARPA Re: Rod Brooks
Received: from SUMEX-AIM by SU-AI with TCP/SMTP; 5 Mar 84 09:17:20 PST
Date: Mon 5 Mar 84 09:09:32-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Re: Rod Brooks
To: JMC@SU-AI.ARPA
cc: bgb@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Sat 3 Mar 84 17:01:00-PST
Yes, of course -- just an oversight that I left him off my distribution list.
bgb
-------
∂05-Mar-84 1406 JMC*
Kreisel at 4:30
∂05-Mar-84 1406 JMC*
papers to Chudnovsky
∂05-Mar-84 1526 RPG awards
I'm curious about these ``Presidential Young Invesitagotor's Awards.''
Are they only for young faculty? Young principal investigators?
By the way, I will be travelling to DARPA again next week if there are
any messages or discussions you think I should have with them.
-rpg-
∂05-Mar-84 1843 PEREIRA@SRI-AI.ARPA Re: Veronica Dahl
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Mar 84 18:43:14 PST
Date: Mon 5 Mar 84 18:44:58-PST
From: PEREIRA@SRI-AI.ARPA
Subject: Re: Veronica Dahl
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Fri 2 Mar 84 17:28:00-PST
I think I can find money to help support Veronica's visit.
Do you have exact dates and any other useful details so that
I can set the bureaucratic wheels in motion?
-------
∂05-Mar-84 1919 PEREIRA@SRI-AI.ARPA
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Mar 84 19:19:09 PST
Date: Mon 5 Mar 84 19:21:23-PST
From: PEREIRA@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI>" of Mon 5 Mar 84 18:45:00-PST
I may need to know earlier than that to satisfy the bureaucrats,
so I'll call Veronica to get the minimum information to get
things started.
-------
∂05-Mar-84 2309 HST circumscription
i asked for your ijcai-83 paper.
it is not in the proceedings - does it exist at all?
could you help me to find out what happened with the mit-ml machine?my mail
to peter szolowits seems to be lost.
hst
answers to queries
The paper isn't yet ready for publication. I'll put him on the list
for it when it is ready. I don't know whether ML is still operating -
it's a KA-10, and I understand they are being phased out by M.I.T. -
but Szolovits is also known as PSZ@MIT-MC.
dfh
paper
Please put Wolfgang Bibel on the list to receive my next circumscription
paper.
∂05-Mar-84 2314 RPG (on TTY1 2314)
I don't know: it has been down (or gone) for at least 1 week now.
∂06-Mar-84 0843 DFH phone messages
I picked up the following messages from the reception
desk. Apparently they came in yesterday.
1. Philip Straffin, Balot, Wis. 608-365-3391 x367.
Re: McCarthy's revenge rule.
2. Pat Suppes called.
∂06-Mar-84 0908 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, March 9, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 6 Mar 84 09:08:04 PST
Date: Tue 6 Mar 84 09:05:05-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -- Friday, March 9, 1984
To: siglunch@SUMEX-AIM.ARPA
(NOTE: We are trying out a different location this week to see
if this hall is more suitable for our purposes)
------------------------------------------------------------------
SIGLUNCH
Friday, March 9, 1984
LOCATION: Braun Lecture Hall (smaller), ground floor of Seeley Mudd
Chemistry Building (approx. 30 yards west of Gazebo)
12:05
SPEAKER: Ben Grosof
Stanford University, HPP
TOPIC: AN INEQUALITY PARADIGM FOR PROBABILISTIC KNOWLEDGE
Issues in Reasoning with Probabilistic Statements
ABSTRACT:
BACKGROUND: Reasoning with probabilistic knowledge and evidence is
a key aspect of many AI systems. MYCIN and PROSPECTOR were pioneer
efforts but were limited and unsatisfactory in several ways. Recent
methods address many problems. The Maximum Entropy principle
(sometimes called Least Information) provides a new approach to
probabilities. The Dempster-Shafer theory of evidence provides a new
approach to confirmation and disconfirmation.
THE TALK: We begin by relating probabilistic statements to logic. We
then review the motivations and shortcomings of the MYCIN and
PROSPECTOR approaches. Maximum Entropy and Dempster-Shafer are
presented, and recent work using them is surveyed. (This is your big
chance to get up to date!) We generalize both to a paradigm of
inequality constraints on probabilities. This paradigm unifies the
heretofore divergent representations of probability and evidential
confirmation in a formally satisfactory way. Least commitment is
natural. The interval representation for probabilities includes in
effect a meta-level which allows explicit treatment of ignorance and
partial information, confidence and precision, and (in)dependence
assumptions. Using bounds facilitates reasoning ABOUT probabilities
and evidence. We extend the Dempster-Shafer theory significantly and
make an argument for its potential, both representationally and
computationally. Finally we list some open problems in reasoning with
probabilities.
-------
∂06-Mar-84 1802 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 6 March 1984
Current Charges 0.30 (vending machine)
-------
TOTAL AMOUNT DUE 0.30
Please deliver payments to Diana Hall, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
∂06-Mar-84 1851 DE2SMITH@SUMEX-AIM.ARPA book reminder
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 6 Mar 84 18:51:49 PST
Date: Tue 6 Mar 84 18:51:10-PST
From: David E. Smith <DE2SMITH@SUMEX-AIM.ARPA>
Subject: book reminder
To: jmc@SU-AI.ARPA
Phone: (415)497-1809, 948-3259 (home)
Do you happen to have the book:
Loveland, D., "Automated Theorem Proving: A Logical Basis"
North-Holland, 1978.
The library's copy is missing and I'd like to have a look at it.
Thanks,
D. E. Smith
-------
de2smith@sumex-aim.arpa
book
Sorry, I don't have it.
∂06-Mar-84 2359 WALKER@SRI-AI.ARPA A major change in prospect
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 6 Mar 84 23:59:08 PST
Date: Tue 6 Mar 84 23:59:42-PST
From: Don Walker <WALKER@SRI-AI.ARPA>
Subject: A major change in prospect
To: Friends-and-Colleagues: ;
Dear Friends and Colleagues,
The time has finally come for me to join the migrating throng and seek
my fortune in the great wide world. After 13 years at SRI International,
deciding to leave it has not been an easy choice; I will miss a remarkable
institution, wonderful people, a distinctive life style, and a set of
memories that will always stay with me.
Needless to say, the call that would provoke such an action must be
something special, and indeed it is. Bell Communications Research, an
organization newly formed by the seven telephone operating companies to be
their very own "Bell Labs," has asked me to head a group devoted to
'Artificial Intelligence and Information Science Research.' This position
will provide me with a unique opportunity to pursue the goals embodied in
the 'Natural-Language and Knowledge-Resource Systems Program' that I
recently established at SRI.
I will begin working on a part-time basis for Bell Communications
Research late this month, although the separation from SRI and the
transition from Menlo Park and Palo Alto to Morristown, New Jersey, will not
be complete until late in July. During this interim period, I will be
spending most of my time on the West Coast, so general communications should
continue to be directed to SRI. The COLING84 conference, which will be held
2-6 July at Stanford, marks the turning point. I deeply appreciate the
support and cooperation being provided by both SRI and Bell Communications
Research in facilitating this unusual change of state.
My involvements with the Association for Computational Linguistics and
the International Joint Conferences on Artificial Intelligence will continue
from my new location, as will my now less active participation in the
American Association for Artificial Intelligence. I look forward to further
personal and professional interactions with you all.
Respectfully,
Don
-------
∂07-Mar-84 0835 RINDFLEISCH@SUMEX-AIM.ARPA Important: DARPA Strategic Computing Submissions
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Mar 84 08:35:16 PST
Date: Wed 7 Mar 84 08:34:31-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Important: DARPA Strategic Computing Submissions
To: Feigenbaum@SUMEX-AIM.ARPA, Nii@SUMEX-AIM.ARPA, Brown@SUMEX-AIM.ARPA,
Delagi@SUMEX-AIM.ARPA, RPG@SU-AI.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, Ullman@SU-HNV.ARPA,
Cheriton@SU-HNV.ARPA, Hennessy@SU-SHASTA.ARPA
Some confusion had arisen about at least the Expert Systems Technology
sources sought announcement that appeared in the Commerce Business Daily
on Feb. 21. Many of us had been going on a prerelease version of the
announcement that did not contain all of the information in the actual
published version. In particular, DARPA wants >>BOTH<< a 5-page
qualification statement and a 15-page proposal by March 22! They plan to
convene a review group on March 27-29 to decide on actual awards using FY84
money. They want to start some of the contracts by July. Therefore, we
must get our various proposals for this program together fast!
I have a call in to Steve Squires to check on the multiprocessor
architecture submission and review plan.
Tom R.
-------
∂07-Mar-84 0929 AAAI-OFFICE@SUMEX-AIM.ARPA Walker
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Mar 84 09:28:54 PST
Date: Wed 7 Mar 84 09:13:39-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Walker
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
I've been thinking that the AAAI should honor Don Walker during the
conference. As you know, he's been instrumental in running the
organization during its early days, and he regularly offers support
on official matters of the AAAI. I thought we could give him a
"Certificate of Appreciation" similar to the one we gave to MArtin
Denicoff. In fact, there may be other people who should honor. Can you suggest
them? Raj?
What do you think of this idea?
Claudia
-------
∂07-Mar-84 1141 LAMPING@SU-SCORE.ARPA Comp
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Mar 84 11:41:17 PST
Date: Wed 7 Mar 84 11:31:55-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Comp
To: JMC@SU-AI.ARPA
Is it time to discuss questions again? If so, when would be good?
-------
∂07-Mar-84 1215 PACK@SU-SCORE.ARPA Letter of Recommendation
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Mar 84 12:15:10 PST
Date: Wed 7 Mar 84 12:14:13-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Letter of Recommendation
To: jmc@SU-AI.ARPA
I was just hired by SRI's AI center. They are interested in having me
be in the PhD Honors Coop program. Brian Reid has agreed to accept a
late application from me if I get it in by tomorrow at 10.
Would you be interested in writing a letter of recommendation for me?
It needn't be submitted on any particular form. The only
requirements are that it include a statement by me saying that the
letter was solicited, and whether or not I waive the right to read the
letter afterwards, and that it be submitted in a sealed envelope.
I can furnish my statement late this afternoon.
Thank you,
Leslie
-------
∂07-Mar-84 1316 MULLER@SU-SCORE.ARPA EKL - match/sublis
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Mar 84 13:16:35 PST
Date: Wed 7 Mar 84 13:03:25-PST
From: Eric Muller <MULLER@SU-SCORE.ARPA>
Subject: EKL - match/sublis
To: jk@SU-AI.ARPA, jmc@SU-AI.ARPA
I now have the proof of the simple fact :
match (p,e,b) <> no => alistp match (p,e,b)
More interesting, I used high←order←definition to define (not defax, as
previously) match.
All this is in the file match.lsp[1,exm].
eric muller.
-------
∂07-Mar-84 1401 JMC*
Chicago paper
∂07-Mar-84 1753 PACK@SU-SCORE.ARPA Recommendation, again...
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Mar 84 17:53:09 PST
Date: Wed 7 Mar 84 17:46:37-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Recommendation, again...
To: jmc@SU-AI.ARPA
I tried to come and talk with you this afternoon, but you were busy.
I'm sorry to be asking on such short notice, but I left a form with
Diana if you care to fill it out. Nils is encouraging me to try to
get into the program starting this Fall. If you would like to talk
about this further, I could meet you tomorrow morning, or feel free to
call me at home (321-9963).
Thanks,
Leslie
-------
Has the Department agreed to consider your late application?
∂07-Mar-84 1757 PACK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Mar 84 17:57:42 PST
Date: Wed 7 Mar 84 17:57:42-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 7 Mar 84 17:54:00-PST
Yes. I spoke with Brian Reid this morning, and he said that if I
had it in by tomorrow noon it would be considered. I have also asked
David Luckham and Stuart Reges for recommendations.
-------
OK, I'll get mine in. Can you get a good recommendation from some philospher?
∂07-Mar-84 1802 PACK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Mar 84 18:02:41 PST
Date: Wed 7 Mar 84 18:02:34-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 7 Mar 84 17:59:00-PST
Not in short order. Ian Hacking probably would have been my best one,
but he's in Canada now, I think. I might still have recommendations
on file from him and Julius Moravcsik from when I applied to the
co-terminal program. I mostly just took courses in philosophy -- no
particular work to set me apart.
-------
∂08-Mar-84 0759 JRP@SRI-AI.ARPA meeting today
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 8 Mar 84 07:59:05 PST
Date: Thu 8 Mar 84 08:00:45-PST
From: John Perry <JRP@SRI-AI.ARPA>
Subject: meeting today
To: wasow%psych@SU-SCORE.ARPA, kay@PARC-MAXC.ARPA, jmc@SU-AI.ARPA,
tw@SU-AI.ARPA, tw@PARC-MAXC.ARPA, stan@SRI-AI.ARPA
I hope we can have an education committee meeting today after tin lunch.
Terry Winograd will try to be there, so we can discuss the relation of
our program with the courses and seminars he usually teaches, and get his
advice on various matters.
-------
∂08-Mar-84 1000 JMC*
Pack letter
∂08-Mar-84 1200 DFH Res. asst. money/L. Pack
Yes, there is money, but for the moment at least she
will have to be charged either to your NSF or Jussi's,
since ARPA money is still not completely settled.
Actually, I have charged some student research expense
to Jussi's account anyway, since there was a fair amount
budgeted for it there.
∂08-Mar-84 1426 HAYM@SU-SCORE.ARPA cs206 final, compactify
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Mar 84 14:26:05 PST
Date: Thu 8 Mar 84 14:01:13-PST
From: Haym Hirsh <HAYM@SU-SCORE.ARPA>
Subject: cs206 final, compactify
To: jmc@SU-AI.ARPA
these are the functions used for compactify
they are on <HAYM>COMPACTIFY.LSP at SCORE
-----
(DEFUN COMPACTIFY (X)
(CAR (COMPACT X NIL)))
(DEFUN COMPACT (X U)
(IF (MEMBER X U)
(CONS (CAR (MEMBER X U)) U)
(IF (ATOM X)
(CONS X (CONS X U))
(COMPACTSUB X (CDR (COMPACT (CAR X) U))))))
(DEFUN COMPACTSUB (X U)
(COMPACTJOIN X (CDR (COMPACT (CDR X) U))))
(DEFUN COMPACTJOIN (X U)
(COMPACTRESULT (CONS (CAR (MEMBER (CAR X) U))
(CAR (MEMBER (CDR X) U)))
U))
(DEFUN COMPACTRESULT (X U)
(CONS X (CONS X U)))
(setq x (compactify '((a.b).(a.b))))
((A . B) A . B)
(eq (car x) (cdr x))
haym@score
final
I'm finally convinced that your COMPACTIFY is correct, and now I'll
see what that does to the grade. Sorry I took so long and had to be
reminded so many times, but looking at that exam again was not something
I wanted to do.
∂08-Mar-84 1600 DFH ai qual
Marilyn says she knows of no committee on this unless
it's just the same people who were on it last year. She
says she thought you were in charge of it.
∂08-Mar-84 1605 DFH Collin Mick
Called. Please phone him at 856-3666.
∂08-Mar-84 1626 DFH Dr. Doll's lectures
Please phone Michael Kennedy re above.
work: 606-266-7883
home: 606-272-1400
∂08-Mar-84 1929 @SRI-AI.ARPA:EMAIL@SRI-KL.ARPA New SRI Phone Book
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 8 Mar 84 19:29:41 PST
Received: from SRI-KL.ARPA by SRI-AI.ARPA with TCP; Thu 8 Mar 84 19:26:45-PST
Date: Thu 8 Mar 84 19:15:49-PST
From: EMAIL Survey <EMAIL@SRI-KL.ARPA>
Subject: New SRI Phone Book
To: phone-book-request@SRI-KL.ARPA
We need your help to complete the latest issue of the
SRI Phone Directory. This issue of the Phone Directory will
include, for the first time, an Electronic Mail (EMAIL) address
for those SRI employees utilizing this computer communications
resource.
The response we need, sent either by EMAIL or by
inter-office mail, is your preferred EMAIL address. Please send
us your username and machine name for the machine you use to
read mail most frequently. Also, please include your SRI I.D.
number for internal use. Your SRI I.D. number will not be
included in the SRI Phone Directory. Please REPLY via email to
EMAIL@SRI-KL, or by inter-office mail to "EMAIL" at location
PN314.
EXAMPLE:
>
> My username is SMH, the machine I use most frequently
> for reading mail is SRI-KL, and my I.D. number is 31416.
>
> Thanks,
> Scott M. Hinnrichs, x6199
Please respond as soon as possible, and by Thursday,
March 15th. To include your EMAIL address in this issue of the
phone directory you must act promptly.
For those of you unfamiliar with the available EMAIL
resources we invite you to call Computer Consulting (X4000)
about the added communications flexibility EMAIL provides.
This message is being sent via EMAIL and inter-office
mail. Please reply via the appropriate medium.
Thank you for your help.
Scott M. Hinnrichs
EMAIL address: smh@sri-kl
Office: PN333
-------
∂08-Mar-84 2005 @SRI-AI.ARPA:EMAIL@SRI-KL.ARPA New SRI Phone Book
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 8 Mar 84 20:05:33 PST
Received: from SRI-KL.ARPA by SRI-AI.ARPA with TCP; Thu 8 Mar 84 20:03:56-PST
Date: Thu 8 Mar 84 19:57:43-PST
From: EMAIL Survey <EMAIL@SRI-KL.ARPA>
Subject: New SRI Phone Book
To: phone-book-request@SRI-KL.ARPA
We need your help to complete the latest issue of the
SRI Phone Directory. This issue of the Phone Directory will
include, for the first time, an Electronic Mail (EMAIL) address
for those SRI employees utilizing this computer communications
resource.
The response we need, sent either by EMAIL or by
inter-office mail, is your preferred EMAIL address. Please send
us your username and machine name for the machine you use to
read mail most frequently. Also, please include your SRI I.D.
number for internal use. Your SRI I.D. number will not be
included in the SRI Phone Directory. Please REPLY via email to
EMAIL@SRI-KL, or by inter-office mail to "EMAIL" at location
PN314.
EXAMPLE:
>
> My username is SMH, the machine I use most frequently
> for reading mail is SRI-KL, and my I.D. number is 31416.
>
> Thanks,
> Scott M. Hinnrichs, x6199
Please respond as soon as possible, and by Thursday,
March 15th. To include your EMAIL address in this issue of the
phone directory you must act promptly.
For those of you unfamiliar with the available EMAIL
resources we invite you to call Computer Consulting (X4000)
about the added communications flexibility EMAIL provides.
This message is being sent via EMAIL and inter-office
mail. Please reply via the appropriate medium.
Thank you for your help.
Scott M. Hinnrichs
EMAIL address: smh@sri-kl
Office: PN333
-------
smh@sri-kl
mailing list
I'm an occasional consultant and don't have a regular SRI mailing
address. I suppose the message was forwarded to me, although I'm
not sure why. I'm also connected with CSLI, although I don't think
I have an SRI account from that. My login at SRI is MCCARTHY, but
I prefer mail addressed to JMC@SU-AI.
∂09-Mar-84 1501 ME unformatted files
There is not much that E can explain in the small space at the bottom of
the screen, so it simply tells you the bare facts. You always have the
various possibilities for saving the text, such as: attaching it and
moving it to a new window, attaching it and switching to another (possibly
the same, but formatted) file, mailing it to yourself, or saying ⊗xSave to
have E save all incore text in an emergency file. I suppose I could mention
one of these in the brief message about unformatted files (etc.). However,
you're supposed to get that message as soon as you start editing a page
in such a file, and then again anytime you try to write it out. Formatting
a file is offered automatically if you try to edit a file NOT in /R mode.
One page files are always "formatted" (/N), so you can just say ⊗xReadWrite.
Probably that's what you did before adding a pagemark and making it two
pages. Then you probably went back to the file /R, at which point it is
really unformatted as far as E knows. Saying ⊗xReadWrite at such a point
will report that you can't do that, as will trying to change any text.
∂09-Mar-84 1636 DFH XGP
Don Coates stopped by to say that it had been fixed
again and the drum replaced, and that if you wanted to
re-run anything, it might look better now.
∂09-Mar-84 2240 FEIGENBAUM@SUMEX-AIM.ARPA Re: admissions status: whiteballs
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 9 Mar 84 22:40:11 PST
Date: Fri 9 Mar 84 22:39:11-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: admissions status: whiteballs
To: Reid@SU-SCORE.ARPA
cc: golub@SU-SCORE.ARPA, jmc@SU-AI.ARPA
In-Reply-To: Message from "Brian Reid <Reid@SU-SCORE.ARPA>" of Thu 8 Mar 84 21:02:21-PST
Brian,
I don't agree with your proposal because it erodes a traditional
prerogative of a faculty member (and as I mentioned in my last note on
this, a tradition that goes back all the way to the founding of
the modern university). In that sense, I am a "conservative". If we want
not to conserve this tradition, let's change it with full discussion
sometime in a faculty meeting.
In general, the evaluation of candidates is a subjective affair (although
we strive each year to make it otherwise). In particular, as you said at
a meeting earlier this year, once we're down to the last eighty, the
random draw would yield as "good" a set as any other. The most
important "qualification" a candidate can have is that a faculty member
wants her/him. Certainly this can be abused, but as JMc pointed out,
limiting this to one (per faculty member) limits the possibility of
abuse to the level of the negligible.
There is no "greater good" in your striving for the "best" set of
admittees (indeed there is no "best" set that we know how to determine).
There is only the sum of the "individual goods". The faculty IS the
department, and I propose that we continue this "individual good"
or if we must change it, then only with considerable discussion by
the faculty.
To be concrete, what this means is that "whiteballed" applicants (to use
your term) should receive "yes" letters (but limited to one per faculty
member).
With best wishes,
Ed
-------
reid%glacier,feigenbaum%sumex,golub%score
whiteball
I agree with Ed for essentially the reasons he gave. I also believe
that the prerogative should be used rarely. I have used it once or
twice in more than twenty years.
∂09-Mar-84 2309 RPG Travel
Diana tells me that the ARPA grant has no more travel funds in it.
This seems odd because it recently started and has 3 more years to go.
I was under the impression my portable common lisp part had a lot of
travel in it. Here is Diana's message:
∂09-Mar-84 1637 DFH travel/ARPA
If you anticipate any more trips that will have to
be paid for from ARPA funds, let me know in advance.
Betty is very concerned that they will disallow the
expense at the end of the contract, since travel
cannot be considered "necessary to continue the research,"
and we have no funds specifically allotted to travel left.
She wants to try to get approval for it from Rob Simpson
in advance. Thanks. -- Diana
This may present a problem because I have to go to Pittsburgh wednesday
for the Lisp conference meeting. Although ACM will pay for some of the travel,
I doubt they can pay for all because they have $2k for all travel to this
meeting. What do you suggest?
-rpg-
rpg,dfh/cc
travel
The contract still isn't in proper shape. I suggest you put the case
by MAIL to Betty Scott, and ask her what she can do, following it up
by a phone call on Monday. However, if worst comes to worst, I'll
back up the trip with unrestricted money so that if the charge is
disallowed, that will pay. Apparently, the incompetence in NAVELEX
continues, so we are proceeding on some sort of month by month basis
with only expenses deemed essential allowed.
∂09-Mar-84 2353 LAWS@SRI-AI.ARPA Beliefs of Thermostats
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 9 Mar 84 23:47:23 PST
Date: Fri 9 Mar 84 23:49:16-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: Beliefs of Thermostats
To: JMC@SU-AI.ARPA
cc: laws@SRI-AI.ARPA
I have no general difficulty in ascribing beliefs to mechanism.
In the particular case of thermostats, however, I have some
reservations.
Although we could ascribe beliefs to rocks, it would seem to
violate an aesthetic principle of economy. Likewise, it seems
unreasonable to ascribe to thermostats any beliefs about humans
in its sphere of influence and the effects of temperature on
their comfort. The behavior of a simple thermostat can be
explained (or predicted) just as well without imagining that
the thermostat has any such mental baggage.
The minimal belief set, assuming that we ascribe beliefs at all,
appears to be on the order of the thermostat believing that the
room is too warm or, equivalently, believing that its switch
should be open at this time. It believes these things because
of its physical structure and organization.
The first statement, though, implies that the thermostat has
some notion of its environment, at least to the level of ambient
temperature, and some notion of the temporal effects on that
environment of the action(s) that it can take at the current time.
The second statement is just as bad since the word "should"
introduces either normative/ethical concepts or some awareness
of possible worlds.
I would find such attributions palatable in more complex mechanisms,
but surely the beliefs of a thermostat should be limited to the
>>here<< and >>now<< if its behavior can possibly be explained
by such means. Its beliefs and reasoning should be of the form
"I am too warm, therefore my switch is open."
This, of course, is such a primitive level of belief that it fails
to provide the naive mental model of thermal homeostasis that you
were seeking when you began the inquiry into beliefs of machines.
The concept of negative feedback must now be supplied by the person
thinking about the thermostat, or at best is only implicit rather
than explicit in the thermostat's belief set. A pity, but if you
are looking for the smallest meaningful "unit of belief", I think
this is it. Attributing more powerful beliefs to the thermostat
is a useful heuristic, but is not fully justified and will no doubt
raise the hackles of philosophers.
-- Ken Laws
-------
laws@sri-ai
beliefs of thermostats
Thanks for your message. I have two comments.
1. First, you missed a transition that arose in the discussion. Ascribing
beliefs about what temperatures made what humans comfortable was in
connection with a hypothetical more elaborate temperature control
mechanism that was designed to take such facts into account. For
the very simplest thermostat, I proposed only the beliefs, "the room is
too cold", "the room is too hot", and "the room is ok".
Perhaps I made the transition without adequate notice.
2. Second, there is the question of whether the thermostat believing
"the room is too cold" requires that the thermostat know how sentences
are constructed from parts, i.e. that it somehow generate or understand
the sentence. I don't want to assume any such thing. "The room is
too cold" is how we express the belief. Ascribing the belief is
supported by the fact that the thermostat does what will achieve
the goal we also ascribe to it, i.e. making the temperature ok.
Also, please remove me as a subscriber to the AI list digest, since
I'll change to reading the public copy.
∂10-Mar-84 0812 reid@Glacier Re: admissions status: whiteballs
Received: from SU-GLACIER.ARPA by SU-AI.ARPA with TCP; 10 Mar 84 08:12:29 PST
Date: Saturday, 10 March 1984 08:11:18-PST
To: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Cc: Reid@SU-SCORE.ARPA, golub@SU-SCORE.ARPA, jmc@SU-AI.ARPA
Subject: Re: admissions status: whiteballs
In-Reply-To: Your message of Fri 9 Mar 84 22:39:11-PST.
From: Brian Reid <reid@Glacier>
Ed,
If you re-read my note, I am not saying that the admissions committee
will not do whiteballs. I said that we are not going to consider the
current round of "put this person in round II please" computer mail
notes to be whiteballs.
If you want to have a person admitted, give us a note to that effect,
in writing, on a piece of paper, which we can put into that person's
permanent application file, and we will admit him. My previous note
said this same thing but in contrapositive--if you don't do this we
won't admit him.
Brian
∂10-Mar-84 1000 JMC*
Kreisel
∂10-Mar-84 1716 PACK@SU-SCORE.ARPA Re: assistantship offer
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Mar 84 17:16:31 PST
Date: Sat 10 Mar 84 17:15:48-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Re: assistantship offer
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 9 Mar 84 23:17:00-PST
I would like very much to work for you next quarter. Do I need to do
anything in order to make sure that the appropriate papers arrive on
registration day?
I am also interested in the possibility of working for you if I get
into the Ph.D. program. I'll wait and see if I get in before I make
any decisions, though.
-------
∂11-Mar-84 0046 rsw@cmu-ri-rover tentacles
Received: from CMU-RI-ROVER.ARPA by SU-AI.ARPA with TCP; 11 Mar 84 00:46:37 PST
Date: 11 Mar 1984 03:38:14-EST
From: Richard.Wallace@CMU-RI-ROVER
To: jmc@sail
Subject: tentacles
I have a copy of Pieper's thesis with his kinematic solutions
for the ORM tentacle manipulator. It also has two pictures
of the ORM built at SAIL. Do you know what became of the ORM?
Matt Mason told me he saw it in someone's office. Were any
other tentacles built at Stanford after the ORM?
I'm collecting information about tentacles for a paper I'm
writing on their kinematics.
R/W
Richard.Wallace@CMU-RI-ROVER
tentacles
None were built after the orm, and the orm was never connected
to the computer. The orm ought to be around somewhere, possibly
still in the old Lab building, possibly in the 5th floor storeroom
of the Computer Science Department. Les Earnest (LES@SU-AI) might
know and so might Victor Scheinman who built it (I think).
∂11-Mar-84 1445 CLT tonight
i think i would rather not go to pippin tonight
I like Schubert, so perhaps I'll go anyway.
∂11-Mar-84 2227 LAWS@SRI-AI.ARPA Re: beliefs of thermostats
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 11 Mar 84 22:27:36 PST
Date: Sun 11 Mar 84 22:29:21-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: Re: beliefs of thermostats
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 10 Mar 84 00:04:00-PST
I'll make the change in the AIList distribution.
I was aware of the transition between simple and elaborate thermostats,
and was only commenting on the simple ones in my message. My point was
that, for the simple thermostat, we would not want to say "It believes
that I am too warm, and therefore it will shut off the heat." We can
build a simpler mental model of the thermostat's action based on ambient
temperature; the concepts of humans and human comfort are unnecessary
and thus inelegant. This appears to be in accord with your own theory of
thermostat beliefs and scientific parsimony, and establishes a common
ground for further reasoning. I'm sorry that I didn't make it clear that
I was in complete agreement with you.
I then diverged from your line of reasoning as expressed at the talk and
in your reply to me. I am concerned that you ascribe to the thermostat
not only beliefs about its current state, but also goals or knowledge of
the potential effects of its actions. I have no objection to the
thermostat knowing (or believing) its current state, and I am only a
little uneasy at the idea that it knows what states it could be in were
its environment different. I object, however, to the idea that it
believes it can change its environment through its own actions. >>We<<
know that the thermostat's purpose is to control the environment, but
the thermostat's belief should be that the environment controls it. If
you want to talk about the entity that does believe it can control its
environment, you should be talking about the heating system as a whole
rather than just the thermostat.
In part, my position is a reaction to your statement that a rock is the
zero of belief and a thermostat is the unit measure of belief. I accept
this with my restricted view of a thermostat, but not with your more
liberal view. I agree, though, that your view is more in line with the
way that people normally reason (when rigor is not demanded), and that
it is a more powerful view for making high-level statements.
Thanks for listening.
-- Ken Laws
-------
∂12-Mar-84 0026 reiter%ubc.csnet@csnet-relay.arpa equality
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 12 Mar 84 00:26:46 PST
Received: by csnet-relay via ubcpob; 12 Mar 84 3:09 EST
Date: Sun, 11 Mar 84 19:46:27 pst
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8403120346.AA15038@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA15038; Sun, 11 Mar 84 19:46:27 pst
To: JMC%su-ai.arpa@csnet-relay.arpa
Subject: equality
Dear John,
Etherington's proof seems to have a fatal flaw.
Here is my simple proof that circumscribing the equality predicate in a theory
T(=) yields nothing new, i.e. that
T(=) proves Circumscription schema for =
Assume T(=) contains the usual axioms for equality, in particular (x)x=x, and
axioms sanctioning the substitution of equal terms for each other.
We want to show
T(=) proves [T(phi) & [(xy)phi(x,y) --> x=y]] --> [(xy)x=y --> phi(x,y)]
i.e. show
T(=), T(phi), [(xy)phi(x,y) --> x=y], a=b proves phi(a,b)
Now T(=) contains (x)x=x, so T(phi) contains (x)phi(x,x)
So with (x)phi(x,x), a=b and the principle of substitution we can prove
phi(a,b). QED
I also think that circumscription may have other limitations. For example,
intuitively, circumscribing P in (Ex)P(x) should yield (E!x)P(x). I have
tried very hard to get this but can't. Do you know how?
Best wishes, Ray.
∂12-Mar-84 0557 RINDFLEISCH@SUMEX-AIM.ARPA HPP Source Qual Statement
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 Mar 84 05:56:59 PST
Date: Mon 12 Mar 84 05:56:04-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: HPP Source Qual Statement
To: Squires@USC-ISI.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
nii@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA,
RPG@SU-AI.ARPA, Ohlander@USC-ISI.ARPA
Steve, You should be receiving a source qualification statement via Federal
Express this morning in response to your Multiprocessor Computer
Architecture Project announcement in the CBD. It is under Ed Feigenbaum
as PI and involves a close collaboration between members of the Stanford
Heuristic Programming Project, John McCarthy and Dick Gabriel from the
Stanford Formal Reasoning Project, and Bruce Delagi from DEC.
Rather than just working on multiprocessor hardware designs and seeing what
symbolic computing problems they are useful for, we propose to work on
integrated software and hardware architectures for concurrent symbolic
computing in knowledge-based systems. This work will be driven by
applications involving signal understanding and will investigate concurrency
derived from the application domain, the organization and use of knowledge
and problem solving strategies, the implementation languages and system
software, and the underlying computing hardware.
We recognize that with this vertical cut, from application through
underlying hardware, there is a strong intersection of this proposed work
with other parts of the Strategic Computing Program. We are also preparing
a related submission for consideration under Ron Ohlander's Expert Systems
Project later this month.
Please let us know if you need additional information. Tom R.
-------
∂12-Mar-84 1139 Solomon.Datanet@MIT-MULTICS.ARPA Ithiel
Received: from MIT-MULTICS.ARPA by SU-AI.ARPA with TCP; 12 Mar 84 11:39:09 PST
Acknowledge-To: Solomon@MIT-MULTICS.ARPA
Date: Mon, 12 Mar 84 14:35 EST
From: Solomon@MIT-MULTICS.ARPA (Richard Jay Solomon)
Subject: Ithiel
To: jmc@SU-AI.ARPA
Message-ID: <840312193538.316974@MIT-MULTICS.ARPA>
Ithiel died Saturday night. We're all very sad. It came much more
quickly than we thought. There will be a memorial service at MIT this
weekend.
Richard
I'm sorry to here about Ithiel. He accomplished a lot.
∂12-Mar-84 1207 SJG
John -
Sally (my fiancee) arrives Wednesday; we will travel around California
some and then she has asked me to go to England for April. Since she
is coming here for good in June (and is currently not looking forward to
it), I had better accept! Anyway, I haven't seen you for a bit (sufficiently
long that I have changed my mind about circumscription again...); any chance
of our getting together for a talk before I leave?
(I note in passing that you may feel my current lack of confidence
in circumscription to be a good thing, since a lasting side effect of my
temporary belief in it appears to be a loss of interest in probability.)
Anyway, I hope we can get together in the next couple of days.
Yours, Matt
"Oh, to be in England when April's here" or something like that. How
about this afternoon at three?
Maybe it's "Oh to be in England now that April's there."
∂12-Mar-84 1304 EMMA@SRI-AI.ARPA Mailing lists !important!
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 12 Mar 84 13:03:41 PST
Date: Mon 12 Mar 84 13:06:07-PST
From: Emma Pease <EMMA@SRI-AI.ARPA>
Subject: Mailing lists !important!
To: csli-d1@SRI-AI.ARPA, csli-d2@SRI-AI.ARPA, csli-d3@SRI-AI.ARPA
8-Mar-84 10:33:32-PST,1707;000000000001
Date: Thu 8 Mar 84 10:33:32-PST
From: Emma Pease <EMMA@SRI-AI.ARPA>
Subject: Mailing lists
To: cl-leaders: ;, f-leaders: ;, nl-leaders: ;
I was asked this morning to update the computer language mailing
lists, which I am presently doing. I also have decided to update
the natural language mailing lists (presently a and b areas) and
the foundation mailing lists (presently d area). If I don't hear
any objections by 8 am friday morning I will start updating the lists
as follows:
Natural language
csli-nl1 Extensions of Semantic Theories
csli-nl2 Semantics of Sentences about Mental States
csli-nl3 Integrated Syntactic and Semantic Accounts of Discourse
csli-nl4 Integration of Semantical and Computational Accounts of Discourse
csli-nl5 communication
csli-nl6 Phonology, Morphology, and Syntax
csli-nl7 The Effect of Syntax and Phonology on Discourse Structure
csli-nl8 Strategies and Tactics in the Processing of Utterances
csli-nl9 Computational Properties of Parsing Algorithms
csli-cl1 Semantics of Computer Languages
csli-cl2 The Analysis and Design of Linguistically Coherent
Computer Languages
csli-cl3 Computational Architectures for Reasoning
csli-f1 Computation, Information, and Logic
csli-f2 Reasoning and Planning
csli-f3 Mind and Action
csli-f4 The Commonsense World
csli-nlinterest general information for natural language group
csli-clinterest " " computer language group
csli-finterest " " foundations language group
thank you,
Emma Pease
ps. please excuse multiple copies of this message
-------
-------
∂12-Mar-84 1304 SJG (on TTY74, at TV-102 1304)
sounds good; I'll be in the department somewhere. Matt
∂12-Mar-84 1312 ZAUDERER@SU-SCORE.ARPA Individual Comp. Comm. Mtg with R. Schreiber
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Mar 84 13:12:20 PST
Date: Mon 12 Mar 84 13:11:23-PST
From: Shanee Zauderer <ZAUDERER@SU-SCORE.ARPA>
Subject: Individual Comp. Comm. Mtg with R. Schreiber
To: schreiber@SU-SCORE.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
wilson@SU-SCORE.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, mwalker@SU-SCORE.ARPA
cc: zauderer@SU-SCORE.ARPA
Stanford-Phone: (415) 497-3125
Rob would like to meet with each committee for 1 1/2 hours on Mar. 29 or 30
or April 2 or 3. Please send 2 choices so we increase his chances of
avoiding conflicts. Thanks,
-------
∂12-Mar-84 1318 EMMA@SRI-AI.ARPA mailing lists !important!
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 12 Mar 84 13:18:04 PST
Date: Mon 12 Mar 84 13:20:46-PST
From: Emma Pease <EMMA@SRI-AI.ARPA>
Subject: mailing lists !important!
To: csli-d1@SRI-AI.ARPA, csli-d2@SRI-AI.ARPA, csli-d3@SRI-AI.ARPA,
csli-d4@SRI-AI.ARPA
To celebrate the new csli computer, I am updating the csli mailing
lists.
This message concerns the foundation mailing lists. Please tell me if
you wish to continue, drop or change your address from the applicable
following lists. Please note that F1, f2, f3, and f4 are for those
actively involved; while, Finterest is for those just interested.
(These lists are the same as the area D mailing lists.)
csli-f1 Computation, Information, and Logic
csli-f2 Reasoning and Planning
csli-f3 Mind and Action
csli-f4 The Commonsense World
csli-finterest General interest in foundations
thank you,
Emma Pease
ps. please excuse multiple copies of this message
-------
-------
∂12-Mar-84 1400 JMC*
package for Chudnovskys
∂12-Mar-84 1444 JK
;uniqueness predicate
(wipe-out)
(proof foo)
(decl unique (type: |(?vartype→truthval)→truthval|) (syntype: constant))
(decl prd (type: |?vartype→truthval|))
(decl (var1 var2) (type: |?vartype|))
(define
unique
|∀prd.unique(prd)=
((∃var1.prd(var1))∧(∀var1 var2.prd(var1)∧prd(var2)⊃var1=var2))|)
(trw |unique(foo)| (open unique))
;FOO is unknown.
;the symbol FOO declared to have type (?VARTYPE)→TRUTHVAL
;UNIQUE(FOO)≡(∃VAR1.FOO(VAR1))∧(∀VAR1 VAR2.FOO(VAR1)∧FOO(VAR2)⊃VAR1=VAR2)
(trw |unique(λx.x=1)| (open unique))
;X is unknown.
;the symbol X declared to have type GROUND
;UNIQUE(λX.X=1)
∂12-Mar-84 1458 JK
;uniqueness predicate
(wipe-out)
(proof foo)
(decl unique (type: |(?vartype→truthval)→truthval|) (syntype: constant))
(decl prd (type: |?vartype→truthval|))
(decl (var1 var2) (type: |?vartype|))
(define
unique
|∀prd.unique(prd)=
((∃var1.prd(var1))∧(∀var1 var2.prd(var1)∧prd(var2)⊃var1=var2))|)
(trw |unique(foo)| (open unique))
;FOO is unknown.
;the symbol FOO declared to have type (?VARTYPE)→TRUTHVAL
;UNIQUE(FOO)≡(∃VAR1.FOO(VAR1))∧(∀VAR1 VAR2.FOO(VAR1)∧FOO(VAR2)⊃VAR1=VAR2)
(trw |unique(λx.x=1)| (open unique))
;X is unknown.
;the symbol X declared to have type GROUND
;UNIQUE(λX.X=1)
(decl Q (syntype: bindop) (type: |<?vartype>⊗truthval→truthval|))
(axiom |∀prd.(Q var.prd(var))=unique(prd)|)
(label unique_def)
(label simpinfo)
(trw |Q x.(x=1)| (open unique))
(trw |Q x.foo(x)| (open unique))
Q X.(FOO(X))≡(∃VAR1.FOO(VAR1))∧(∀VAR1 VAR2.FOO(VAR1)∧FOO(VAR2)⊃VAR1=VAR2)
∂12-Mar-84 1636 JK
;uniqueness predicate
(wipe-out)
(proof foo)
(decl unique (type: |(?vartype→truthval)→truthval|) (syntype: constant))
(decl prd (type: |?vartype→truthval|))
(decl (var1 var2) (type: |?vartype|))
(define
unique
|∀prd.unique(prd)=
((∃var1.prd(var1))∧(∀var1 var2.prd(var1)∧prd(var2)⊃var1=var2))|)
(trw |unique(foo)| (open unique))
;FOO is unknown.
;the symbol FOO declared to have type (?VARTYPE)→TRUTHVAL
;UNIQUE(FOO)≡(∃VAR1.FOO(VAR1))∧(∀VAR1 VAR2.FOO(VAR1)∧FOO(VAR2)⊃VAR1=VAR2)
(trw |unique(λx.x=1)| (open unique))
;X is unknown.
;the symbol X declared to have type GROUND
;UNIQUE(λX.X=1)
(decl |∃!| (syntype: bindop) (type: |<?vartype>⊗truthval→truthval|))
(axiom |∀prd.(∃! var.prd(var))=unique(prd)|)
(label unique_def)
(label simpinfo)
(trw |∃! x.(x=1)| (open unique))
;∃! X.(X=1)
(trw |∃! x.foo(x)| (open unique))
;∃! X.(FOO(X))≡(∃VAR1.FOO(VAR1))∧(∀VAR1 VAR2.FOO(VAR1)∧FOO(VAR2)⊃VAR1=VAR2)
∂12-Mar-84 1942 SJG party
350 Sharon Park Drive, Apt. T-11
7-10 pm Thursday
Menlo Park
from intersection of Santa Cruz and Willow/Sand Hill, proceed west on
Sand Hill. First right, then first right again and first left into parking
lot. You are now facing large covered parking lot; T building (mine) is
diagonally across it from you. Caroline too and you can phone me at
854-9515.
Matt
∂13-Mar-84 0900 AAAI-OFFICE@SUMEX-AIM.ARPA draft of local chapters msg
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Mar 84 09:00:48 PST
Date: Tue 13 Mar 84 09:00:21-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: draft of local chapters msg
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Can you please review this draft about local chapters before I send
it out to the Execomm?
Thanks,
Claudia
Dear Colleague:
During the last twelve months, AAAI officers have received several
requests to establish local AAAI chapters in the Pacific Northwest,
Washington, D.C., Boston, and Florida.
As a means of satisfying this emerging need, we propose to help
establish local chapters informally by providing to the local contacts
the members' names and addresses in a particular region. It would
then be the responsibility of that person to reach local people and to
establish meeting schedules and activities. They could also collect
dues to cover direct costs (e.g. phones, room rental). At the same
time, we will need to establish some safeguards so that local contacts
do not abuse the lists of members we provide to them.
We would like to hear your comments on the establishment of local
chapters so that we can respond to these requests.
Claudia Mazzetti
aaai-office@sumex
chapters
Claudia,
The draft on local chapters is ok. I suggest you send it out
over both our names. In general, I think that nothing bad is likely
to happen, and if something does, we can correct it, since chapter
charters should be revokable.
John
∂13-Mar-84 1128 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- FRIDAY, March 16, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Mar 84 11:28:15 PST
Date: Tue 13 Mar 84 11:24:40-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -- FRIDAY, March 16, 1984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
Friday, March 16, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: Bill Swartout
USC/Information Sciences Institute
TOPIC: Explainable Expert Systems
ABSTRACT:
Traditional methods for explaining expert systems provide explanations
by converting the code of the program to English. While such methods
can sometimes adequately explain program behavior, they cannot justify
it. That is, such systems cannot explain why what the system is doing
is reasonable. The problem is that production of justifications
requires knowledge of how the expert system itself was created, but
that knowledge is not recorded as part of the code and hence is
unavailable. This talk will first describe the XPLAIN system, a
previous research effort which used an automatic programmer to capture
the development of an expert system from abstract domain knowledge,
thereby providing the knowledge needed to improve its explanatory
capabilities. We will then outline the goals and research directions
for the Explainable Expert Systems project, a new research effort just
starting up at ISI.
Our current research focuses on three areas. First, we want to extend
the XPLAIN framework to represent additional kinds of knowledge such
as control knowledge for efficient execution. Second, we want to
investigate the generation of systems that can reason either with
abstract knowledge and general methods or highly specific
assumption-based procedures while maintaining a representation of the
relationship between the two forms of knowledge. A system that could
use either abstract or specific methods could be both robust and
efficient -- using its specific knowledge with built-in assumptions
for simple cases but reverting to deeper knowledge for complex cases.
Third, we will use the richer framework provided by the XPLAIN
paradigm to allow the system to form appropriate abstractions when new
knowledge is presented at a too-specific level during knowledge
acquisition.
-------
∂13-Mar-84 1145 AAAI-OFFICE@SUMEX-AIM.ARPA presidential message
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Mar 84 11:45:06 PST
Date: Tue 13 Mar 84 11:32:30-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: presidential message
To: jmc@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Do you plan to have a Presidential Message for the upcoming issue
(vol5#2) of the magazine? We'll need a draft by MArch 22.
Claudia
-------
I'll make another try at a message. Thanks.
∂13-Mar-84 1244 GROSOF@SUMEX-AIM.ARPA visit to cs229b this thursday, 3/15, 9:30am, room 352
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Mar 84 12:43:47 PST
Date: Tue 13 Mar 84 12:43:36-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: visit to cs229b this thursday, 3/15, 9:30am, room 352
To: jmc@SU-AI.ARPA
Hello Prof. McCarthy,
I've just realized that you haven't confirmed whether you will be able to
come visit the class I am running. Below is a copy of the invitation;
when I asked you several weeks ago you said you thought there would be no
problem.
Please let me know as soon as possible whether you will indeed be coming.
Looking forward to your visit...
Benjamin
------------------------------
1-Mar-84 11:58:20-PST,2389;000000000000
Return-Path: <JMC@SU-AI>
Received: from SU-AI.ARPA by SUMEX-AIM.ARPA with TCP; Thu 1 Mar 84 11:58:13-PST
Date: 01 Mar 84 1155 PST
From: John McCarthy <JMC@SU-AI>
Subject: industry lecturers
To: faculty@SU-SCORE, su-bboards@SU-AI
Here are the Industrial Lecture Courses for 1984-85.
They are numbered CS400A, B and C. Each course will be
given by the named computer scientist from industry.
Each year there is a new group of industrial lecturers,
and the courses are not expected to be repeated.
Clarence (Skip) Ellis (Xerox PARC)
Office Information Systems Design.
Technology, techniques, and design paradigms of electronic office
information systems. The objective is to present a coherent and cohesive
foundation for the understanding and analysis of office systems and
their implementation. Topics include: basic components and media such as
word processors, workstations, PBXs, and local area networks; office
firmware such as RasterOps, virtual keyboards, phone handlers, and
window managers; office system elements such as document editors, mail
systems, calendaring systems, and distributed servers. The course will
describe and discuss issues of user interfaces, user programming, office
modeling, and the social / organizational structures within which the
technology must exist. Prerequisites: computer organization (e.g.
cs111,cs112), computer software (e.g. cs142,cs146).
Fall 84 only.
Joe Halpern (IBM San Jose)
400B Reasoning about Knowledge. Formal Systems for modeling aspects
of reasoning about knowledge, such as modal logic, nonmonotonic logic and
relevance logic will be considered. Discussions will address to what
extent these approaches can be used to deal with such problems as
reasoning in the presence of inconsistency, belief revision, and
knowledge representation. Familiarity with mathematical reasoning and
first-order logic will be assumed.
Winter quarter (Halpern) by arrangement.
Richard Waldinger (SRI International)
Seminar in Program Synthesis:
Recent research on the systematic derivation of programs
to meet given specifications, with an emphasis on deductive
approaches. Related topics in theorem proving, logic prog-
gramming, planning, and program transformation. Individual
projects and some student presentations.
Prerequisites: CS157 A/B or equivalent.
Spring 85 only.
9-Mar-84 16:26:41-PST,3735;000000000001
Return-Path: <PATASHNIK@SU-SCORE.ARPA>
Received: from SU-SCORE.ARPA by SUMEX-AIM.ARPA with TCP; Fri 9 Mar 84 16:26:11-PST
Date: Fri 9 Mar 84 16:14:59-PST
From: Student Bureaucrats <PATASHNIK@SU-SCORE.ARPA>
Subject: student meeting/royalty committee
To: students@SU-SCORE.ARPA
cc: bureaucrat@SU-SCORE.ARPA, wiederhold@SUMEX-AIM.ARPA
Reply-To: bureaucrat@score
1) We will have a student meeting on Wednesday, April 4, in the usual
place (Psychology basement, 420-041). Among other things, we'll be
electing TWO new bureaucrats, one to start this quarter and one next
(Kim McCall, elected bureaucrat at the last student meeting, won't be
able to serve spring quarter because of other departmental
obligations).
We've decided to solicit bureaucrat nominations electronically now,
but we'll actually vote on them at the meeting (the two with the most
votes at the meeting will be our new bureaucrats)---we'll announce who
the nominees are a few days before the meeting, but there won't be any
primaries, caucuses, straw polls, or other beauty contests beforehand.
So, over the next few weeks, send us your nominations.
2) Gio Wiederhold, chairman of the `Royalty Committee' described
below, would like one more student volunteer (Rich Pattis is already
on it); he'd prefer one who has not been involved in book production.
Here's his message:
-----
I have been asked to set up an ad-hoc committee to look into the
issues for book production and royalties at the Stanford CSD facilities.
The global question is: should the CS department be a partial beneficiary
of the income generated from books produced using CSD computer facilities,
staff, and other resources. Other resources could include the space and
attention provided to faculty and students while they are working on
such books.
It is a complex question and at most we could illuminate the issues and
present some alternatives. A report to the April CSD senior faculty meeting
is desired.
Questions to be raised include:
Does it include all books or only those which are written for large-scale
reproduction? Traditionally theses, even if published, and other research
monographs are sufficiently desirable that departments are willing to subsidize
such efforts. Maybe this questions is moot when we consider a percentage,
and perhaps also a threshold applied to the royalty. Then popularity speaks
for itself.
What is the relationship to funding sources? Most production and staff costs
ore supported by research grants. Some costs have been paid directly by
the authors or their publishers, specifically the costs for photo-typesetting
supplies. Should source of support make a difference?
At Stanford and most universities the tradition has that the authors hold
the right to intellectual property. This right is now modified in the case
of software, where Stanford desires a 1/3 university and a 1/3 department
share, leaving a 1/3 author share.
Should a sharing policy by the department be enforced or be a suggestion only.
Should the CS department be listed in the publishers' royalty distribution
list? Can a policy be enforced, especially with authors who have shared
affilitation?
I suggest that we would need at least three meetings:
1 brainstorming and ideas
2 formalize the points
3 summarize and complete a report.
Gio 3MAR84
-----
If you're interested in volunteering for this committee and will be
around for most of the month of March, send us a message. Also if you
have any comments about these issues, you can send them to the student
committee members, whom we'll announce once someone volunteers.
--Eric and Oren, bureaucrats
-------
23-Feb-84 17:54:49-PST,1430;000000000001
Mail-From: GROSOF created at 23-Feb-84 17:54:48
Date: Thu 23 Feb 84 17:54:48-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: invitation to speak at CS229b
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA
Hi John,
The discussion session I invited you to be guest for is Thursday,
March 15, 9:30-11:30am, in MJ 352. CS229b is a course oriented to qual
preparation. It consists of reading, student-only discussion sessions on
Tuesdays (9:30-12), and discussions with a guest on Thursdays (9:30-11:30).
The course is organized around one topic per week. Our last week is,
however, miscellaneous, which we have decided to devote to issues of:
supercomputer architecture for AI
programming languages for AI
evaluating AI systems
The class has expressed desire to have you be our guest to discuss these and
your general thoughts on AI.
Our format with guest discussions is informal, basically question-and-answer.
Please feel no responsibility to prepare anything. If you'd like to make
some opening remarks for say half an hour, that's fine.
Please let me know if you'll be able to come, as soon as you can.
----------------------
I really enjoyed getting the opportunity to talk with you at length this
afternoon. I'm quite busy these days what with qual, probabilities, and
programming project, but I will keep thinking about circumscription and
nonmonotonicity.
Benjamin
-------
-------
Unfortunately, I will not be able to attend Thursday. A definite date
somehow didn't get in my calendar, and I will be in Dallas talking at
Texas Instruments on Thursday. Some other time would be possible.
∂13-Mar-84 1424 PHY Search comm. meeting
Don Knuth would like to set up a Search Committee meeting this Thursday
afternoon or next Monday afternoon -- preferably Thursday. Would this
be okay with your schedule - 2:00 to 3:00 Thursday March 15 ?
-Phyllis
I'll be in Dallas Thursday. Next Monday would be ok.
Tuesday the 20th is also ok.
∂13-Mar-84 1456 Solomon.Datanet@MIT-MULTICS.ARPA
Received: from MIT-MULTICS.ARPA by SU-AI.ARPA with TCP; 13 Mar 84 14:55:54 PST
Date: Tue, 13 Mar 84 17:55 EST
From: Solomon@MIT-MULTICS.ARPA
To: John McCarthy <JMC@SU-AI.ARPA>
In-Reply-To: Message of 12 Mar 84 17:31 EST from "John McCarthy"
Message-ID: <840313225516.819770@MIT-MULTICS.ARPA>
There will be a large gap in our lives without him. He had many things
going when he got sick. I am committed to continue the history project.
Ithiel wants me to find someone to do it with at MIT. The last thing he
asked me to do on Friday night was to talk to my advisory board this
week and try to find where & who to deal with here, otherwise to look
for some similar place outside of MIT, possibly the Computer Museum.
We are meeting on Friday. Sloan has given me an extension of our grant
until June, mostly to prepare a proposal to them (or others) for
continuation. Art Singer of Sloan likes what he saw so far, and is very
enthusiastic o about the project. But Sloan may not want to fund all of
it next time, or may want some other sponsors as well as their funds,
for video is expensive. I'm sorry you did not see the tapes, perhaps
after we clean up some segments, I will be able to send you a cassette
to look at.
Anyway, we are open to any suggestions about continuation, more tapg
tapings, etc. Sloan is particularly interested in how such tapes can be
use in educational institutions, and not so much in the archiving
problems. They would rather let someone else worry about archives,
though they appreciate the need to keep these tapes for a long time.
Let's keep in touch on this.
The memorial service is set for Friday after this, March 23, at 2 PM, in
the MIT chapel, in case you know of anyone who may be here and wants to
go. Unfortunately, the Boston Globe got the date wrong. Ithiel would
have thought that pretty funny and indicative of how the press works!
The last week was pretty bad for him. I saw him twice, and was going to
see him Sunday again. He apparently was in pain, but continued to work
up to the end, giving me a list ofthings to do over the weekend, as
usual. I managed to show him the edited tape and some other stuff, and
he proofread the final report and made some good suggestions, but could
barely write. All of the graduate students are pretty broken up over
it; I don't think we were prepared for the end coming so quickly. The
xD}i}i~r~r}i~r{←}ii]g#
∂13-Mar-84 1447 PHY
∂13-Mar-84 1446 JMC
I'll be in Dallas Thursday. Next Monday would be ok.
--
We're now working on Tuesday the 20th 2:30-4:30 -- people are scattering
like mad!
∂13-Mar-84 1512 PHY meeting
Tuesday, March 20 2:30-4:30 MJH 252 for Search committee meeting
∂13-Mar-84 1652 DFH 3/13 phone messages
Art Lubin phoned this morning, was going to try to reach
you at home.
David Campbell, Physicist at Los Alamos, doing survey on AI
for them, would like to talk to you Fri. after noon, Mar. 16
when he will be in the area. 505-667-4073 work, 505-662-4558 home.
You might get a recording at the home no. that answers "cottontails."
Gene Lawler, UCB. 526-0180 morning, 642-4019 afternoon.
Sumi Fowells. C.Mazzetti suggested she call you. Doing some sort
of project on bibliography/data base of AI literature abstracts.
phone 689-0754.
∂13-Mar-84 2100 SGF terminal
There is a possibility that CSLI will buy the terminal for my use.
John Perry said he would discuss it with you.
∂14-Mar-84 0909 AAAI-OFFICE@SUMEX-AIM.ARPA Local Chapters
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Mar 84 09:09:27 PST
Date: Wed 14 Mar 84 08:49:54-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Local Chapters
To: Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA, Buchanan@SUMEX-AIM.ARPA,
ec.brown@CSNET-RELAY.ARPA, KRD@MIT-MC.ARPA, Bengelmore@SRI-KL.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Grosz@SRI-AI.ARPA,
Hart@SRI-KL.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Stan@SRI-AI.ARPA, Stefik@PARC-MAXC.ARPA,
GJS@MIT-MC.ARPA, Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA,
Bonnie.upenn@UDEL-RELAY.ARPA, Bledsoe@UTEXAS-20.ARPA
cc: aaai-office@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Dear Colleague:
During the last twelve months, AAAI officers have received several
requests to establish local AAAI chapters in the Pacific Northwest,
Washington, D.C., Boston, and Florida.
As a means of satisfying this emerging need, we propose to help
establish local chapters informally by providing to the local contacts
the members' names and addresses in a particular region. It would
then be the responsibility of that person to reach local people and to
establish meeting schedules and activities. They could also collect
dues to cover direct costs (e.g. phones, room rental). At the same
time, we will need to establish some safeguards so that local contacts
do not abuse the lists of members we provide to them.
We would like to hear your comments on the establishment of local
chapters so that we can respond to these requests.
Thank you,
John McCarthy
Claudia Mazzetti
-------
∂14-Mar-84 1035 TOB
Could we meet soon, e.g. lunch today, tomorrow or other?
Lunch Friday is possible. I suggest you make a reservation
for noon, since I have a 1:15 class.
∂14-Mar-84 1107 TOB
Done.
∂14-Mar-84 1106 JMC lunch
Lunch Friday is possible. I suggest you make a reservation
for noon, since I have a 1:15 class.
∂14-Mar-84 1256 AAAI-OFFICE@SUMEX-AIM.ARPA [Barbara J. Grosz <GROSZ@SRI-AI.ARPA>: Re: Local Chapters]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Mar 84 12:56:36 PST
Date: Wed 14 Mar 84 12:56:27-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: [Barbara J. Grosz <GROSZ@SRI-AI.ARPA>: Re: Local Chapters]
To: JMC@SU-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Here are some of the comments on the local chapters msg. If we enact
local chapters, we might have to amend the by-laws. At the same time,
we could initiate a two-year terms for Presidents and Presidents-elect.
Claudia
---------------
1) 14-Mar Barbara J. Grosz Re: Local Chapters
2) 14-Mar To: GROSZ@SRI-AI.ARP Re: Local Chapters
Message 1 -- ************************
Return-Path: <GROSZ@SRI-AI.ARPA>
Received: from SRI-AI.ARPA by SUMEX-AIM.ARPA with TCP; Wed 14 Mar 84 09:15:55-PST
Date: Wed 14 Mar 84 09:18:52-PST
From: Barbara J. Grosz <GROSZ@SRI-AI.ARPA>
Subject: Re: Local Chapters
To: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Wed 14 Mar 84 09:11:36-PST
Is someone checking the legal responsibilities of AAAI with respect to
these chapters? This may be important if they collect money. Also, my
experience with SIGART chapters though basically good is that there is
some problem with keeping their activities in the right line (e.g., for
SIGART, noncommercial).
Barbara
-------
Message 2 -- ************************
Mail-From: AAAI-OFFICE created at 14-Mar-84 12:44:37
Date: Wed 14 Mar 84 12:44:37-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Re: Local Chapters
To: GROSZ@SRI-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "Barbara J. Grosz <GROSZ@SRI-AI.ARPA>" of Wed 14 Mar 84 09:15:57-PST
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Barbara,
I've got lots of information about IEEE Chapters (ie by-laws,
requirements, accounting responsibilities). The IEEE has such a rigid
organizational structure ( local chapters, sections,national) that in
many ways isn't the best model for our purposes though the IEEE
chapter operation procedures could be a good guide for us.
Nevertheless, can you send me the name of an ACM person who is
responsible for local chapters formation?
Thanks,
Claudia
-------
-------
∂14-Mar-84 1422 MDD
Virginia said you had phoned inquiring about how I'd made out,
so I'm attaching the following narrative.
Thanks again for you hospitality.
angio[1,mdd]
∂14-Mar-84 1606 AAAI@SU-SCORE.ARPA response to Pres msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Mar 84 16:06:46 PST
Date: Wed 14 Mar 84 16:05:58-PST
From: AAAI-OFFICE <AAAI@SU-SCORE.ARPA>
Subject: response to Pres msg
To: JMC@SU-AI.ARPA
cc: aaai@SU-SCORE.ARPA
John,
We received a letter which responds to your Presidential MSG. I'd like
to include in the next issue their response and your rebuttal.
Claudia
Dear Editor:
In the previous issue's President's Quarterly Message (AI Magazine,
Vol. 4, No. 4), John McCarthy quoted part of a net message from Jon
Doyle, a faculty member here at CMU, to the effect that the students
at CMU are not very interested in fundamental questions, open
problems, and basic research. As graduate students in artificial
intelligence at CMU, we feel that while the over-all article is
clearly directed toward the general case of a real problem, this
introduction gives rise to several unwarranted implications, which
we would like to counter.
First, it should be noted that Jon Doyle stated that his conclusion
was "tentative", whereas John McCarthy refers to it as "definite".
In fact, it was a tentative conclusion, based on attendance at and
responsiveness to introductory lectures about the various faculty
members' interests. This could be an indication of interest, or it
could be an indication that applications are easier to appreciate
during one's first month in graduate school. It should be noted that
most of the students here are engaged in what they consider basic
research, though probably not pure theory (see below).
Secondly, the tone seems to be one of "you students aren't interested
in basic research", rather than that of the title, which is that
"basic research isn't emphasized enough". Clearly, basic research
needs more deliberate emphasis than applications, in AI as in any
science, since the usefulness of applications is always apparent, the
relative quantity of basic research is small, and the importance of
basic research is always hard to impress on the public. An arriving
student's first guess at a research interest is likely to be shaped by
the media attention given it, although one expects the actual research
topic eventually pursued will be the result of deeper inquiry.
Finally, there is an implication, refuted later in the article, that
there are no basic research issues involved in either natural language
or expert systems. There are at least three levels of "depth" in
research: purely theoretical research, basic research involving a
problem domain such as natural language, and "big, build-it-now"
application systems. Bothy types of basic research are less "flashy"
than applications, and require more conscious emphasis than
applications to receive equal attention.
Sincerely,
Robert Frederking
Charles Thorpe
Ellen L. Walker
Linda T. Powell
Steven Mintou
Computer Science Department
Carnegie-Mellon University
Pittsburgh, PA 15213
-------
∂14-Mar-84 1610 BOSACK@SU-SCORE.ARPA Fuji Eagles for the archive machine
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Mar 84 16:10:25 PST
Date: Wed 14 Mar 84 16:09:31-PST
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Fuji Eagles for the archive machine
To: JMC@SU-AI.ARPA
The current price for 10 drives, controllers, cabinets, etc. is now
$125580. I propose to give Systems Industries a letter of intent to purchase
the disks et al and to start the government procurement/approval cycle.
The price of the vax and tape from DEC is about $96K. I'll haggle for a little
better deal but I don't think they'll move. If that is the case, we should
start buying that, as well.
Len
-------
OK, I think you should go ahead.
∂15-Mar-84 0806 PHY
To Chairman Search Committee members
Please come individually to Don Knuth's office - MJH 328 - to read the
resumes of the people who have applied for the Chairman position
before the meeting Tuesday March 20, 2:30.
- Phyllis
∂15-Mar-84 2253 FEIGENBAUM@SUMEX-AIM.ARPA [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: McCarthy Investigation]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 15 Mar 84 22:53:22 PST
Date: Thu 15 Mar 84 22:53:24-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: McCarthy Investigation]
To: jmc@SU-AI.ARPA
John, should I talk with this guy? I dont want to talk with anyone about
you unless you give me permission to do so.....Ed
---------------
Mail-From: EENGELMORE created at 15-Mar-84 17:06:22
Date: Thu 15 Mar 84 17:06:22-PST
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: McCarthy Investigation
To: Feigenbaum@SUMEX-AIM.ARPA
cc: EENGELMORE@SUMEX-AIM.ARPA
PAT REID is an investigator with the Federal Office for Personnel.
He is here doing an investigation re: John McCarthy. You are one of
the people with whom he is supposed to talk. He says it will take
only about five minutes. He will call 7-4879 tomorrow at 2pm to
see if you have time to meet with him.
-------
-------
feigenbaum%sumex
investigation
Sure talk to him. I brought in on myself by applying for a clearance.
In fact, I think I gave you as a reference.
∂15-Mar-84 2332 HST lisp history
i got an answer from perlis.he don't remember very much,especially that
separation into two volumes was not present to him.
he suggested that lisp development was actually under way during june 1958.
for my austin talk i'm quite interested to gather fotographs of the beginning
time.do you have anything in this direction.?
I'm seraching for an old newspapers article containing a funny picture of
you.this was published in the New York Herald Tribune on 24th of may 1959
in the engineering supplement,the article was titled "Dr.McCarthy:Getting
Closer to Machines that think".
However it seems to me that the New York Herald Tribune does not exist any
more.Is that true?Do you have an idea were their stock (or museum) might
be.Do they have still an address?
hst
LISP history
The New York Herald Tribune indeed doesn't exist any more. A newspaper's
files of old stories is called its morgue. I would suggest a library, e.g.
the New York Public Library. I suppose there must be an index of newspaper
holdings of libraries that would say what libraries keep files of the
New York Herald Tribune.
∂16-Mar-84 0004 HST pictures
you did not comment on the pictures topic.
I probably have many polaroid pictures from that era, but I don't
remember taking any of the LISP group. I did take photos of the
Algol meetings that Peter Naur eventually copied. I'll look around.
What sort of picture are you looking for?
∂16-Mar-84 0010 HST pictures
funny or surprising or even quite normal pictures of as much as possible
people connected with lisp.for ex.: you,steve ruessell,dan edwards,the
graduate students of 1958 etc.
this picture in the New York Herald Trbune shows you as a quite young
man full of expectations.I serach for another picture which presents you
in your wild hippie time.(it was published in germany 1974 or so)
∂16-Mar-84 0605 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Local Chapters
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 16 Mar 84 06:04:58 PST
Date: Fri 16 Mar 84 08:02:08-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: Local Chapters
To: AAAI-OFFICE@SUMEX-AIM.ARPA, Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, ec.brown@CSNET-RELAY.ARPA, KRD@MIT-MC.ARPA,
Bengelmore@SRI-KL.ARPA, Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA,
Grosz@SRI-AI.ARPA, Hart@SRI-KL.ARPA, Minsky@MIT-MC.ARPA,
Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA, Stan@SRI-AI.ARPA,
Stefik@PARC-MAXC.ARPA, GJS@MIT-MC.ARPA, Tenenbaum@SRI-KL.ARPA,
Walker@SRI-AI.ARPA, Bonnie.upenn@UDEL-RELAY.ARPA, Bledsoe@UTEXAS-20.ARPA
cc: aaai-office@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Wed 14 Mar 84 11:09:35-CST
I would think that this is a good idea. But I would put on some controls
to protect the good name of AAAI (which they represent), namely have them
give us a short summary ("bylaws") on how they plan to operate: How
officers are elected, what dues are collected, etc. To my mind these
need not be consistent between chapters but we should know what they are.
Woody
-------
∂16-Mar-84 0850 BUCHANAN@SUMEX-AIM.ARPA Re: Local Chapters
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 16 Mar 84 08:50:18 PST
Date: Fri 16 Mar 84 08:50:09-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Re: Local Chapters
To: AAAI-OFFICE@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
cc: bgb@SUMEX-AIM.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Wed 14 Mar 84 08:50:02-PST
Claudia,
I agree with Woody, that we should have on file some information
about the local chapters and should review their bylaws to be sure
they are consistent with the way we want AAAI sub-groups to be
run. For instance, we prefer elected officers to self-appointed ones.
Approval of requests should not be automatic.
bgb
-------
∂16-Mar-84 1141 YK
∂15-Mar-84 0912 JK proposal
Aside from the corrections suggested by Sato, nothing more needs
to be done about the proposal.
Can you bring me and Diana Hall a final copy of the proposal?
Also, JMC likes to keep proposals in his [pro,jmc] directory - could
you copy it over there?
----
I copied the proposal in [PRO,JMC].
It is called SATO.TEX. Yasuko
∂16-Mar-84 1510 SJG desks
Dear fiend -
Please do not displace me from my desk yet! I will indeed be here next term
(and the summer, too, I hope), and will hardly find it any easier to get
things done if I have no place to do them. (I've sent a note to Leslie Pack
to this effect as well.) I hope this makes sense - I am running around
madly today trying to look after Sally. Sorry you didn't get a chance to
say more to her at the party; surely some other time.
Have a good April; I will doubtless be back before the end of it -
Matt
∂16-Mar-84 1534 TAJNAI@SU-SCORE.ARPA research interests
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Mar 84 15:34:05 PST
Date: Fri 16 Mar 84 09:16:40-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: research interests
To: jmc@SU-AI.ARPA
I'm updating the faculty portion of the Annual Report and
would appreciate your updating your section and returning to
me by 4/15. Thanks, Carolyn
@b{John McCarthy},
Professor of Computer Science.@\
Professor McCarthy has worked in the area of formal reasoning applied to
computer science and artificial intelligence since 1957. He has recently
developed a technique for
completely characterizing LISP and other recursive programs within
first order logic by supplementing Cartwright's first order form of the
functional equation by a minimization schema.
This technique is well suited to automatic
proof checking, and in collaboration with Cartwright and Stanford students
Professor McCarthy is exploiting this breakthrough
by verifying more complex programs directly within first order logic. In
addition many of the standard program verification techniques can be
represented by axiom schemas in this system. Recently McCarthy has
discovered how to represent facts about knowledge and belief in unmodified
order logic and the solution works no matter how many mental
qualities must be treated.
He has also recently discovered that an axiom schema of first
order logic called a minimization schema can be used to represent in a
flexible way the conjecture that the entities that can be shown to exist
on the basis of the information in a certain data base are all the
relevant entities that exist. This conjecture is a common feature of
human reasoning. Professor McCarthy has investigated continuous
functionals that don't arise from simple recursive programs. Some of them
require parallel evaluation, and the work may lead to a treatment of
program correctness that unifies parallel programs with the more usual
sequential programs.
In 1979 McCarthy developed a new formalism called ``Elephant'' for
expressing sequential programs as sentences in first order logic.
The formalism permits programmers to avoid defining some data structures
by referring explicitly to the past.
-------
∂16-Mar-84 2150 LLW@S1-A.ARPA PARTY!!!
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 16 Mar 84 21:50:36 PST
Date: 16 Mar 84 2144 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: PARTY!!!
To: "@LOCAL.[1,CEG]"@S1-A.ARPA, jmc@SU-AI.ARPA, rpg@SU-AI.ARPA,
rod@SU-AI.ARPA
All Greater Extended `O' Program Members:
In celebration of the attainment of the Vernal Equinox and a fully
functional S-1 Memory Box, there will be a party next Saturday, 24 March,
starting at 1400 hours (and running 'til PMF closes down the seemingly
inevitable poker game).
This gala event will occur at the Sty In The Sky (the entry point to which
is 4.2 miles north of I-580 on N. Vasco Rd.; close the barbed wire gate
across the splendid new blacktopped driveway entrance on the left-hand
side of Vasco Road after you pass through it). It will feature the usual
picnic/barbeque-style eat-ables and locally favored drink-ables; if you
want something more exotic, feel perfectly free to bring it along.
Highlights of the afternoon/evening (in addition to watching FM, JMB, OTA,
and PMF slug it out for their pooled paychecks) include all expense-paid
tours by PMF of his notorious hot tub salon, by RAH of his fabulous new
library, and by LLW of his recently established orchards; in addition, the
Sty's newly functional solar heating system will be demonstrated for the
incredulous. Most importantly, any virgins which have been obtained will
be sacrificed in the traditional fashion, and JMB will formally award the
stakes of the now-famous EAK-LLW wager on Memory Box functionality-
availability to the proper recipient (at last!).
Come and bring your spouse, semi(-demi-hemi)-spouse, offspring, etc for
another of the blowouts that leaves the whole Lab buzzing for weeks
afterwards!
RSVP to Gloria or Paula, or be thrown to the local pack of wild animals
(including the Sty's infamous Killer Cat) when you show up unexpectedly.
Mike, Rod and Lowell
(for the Sty's Council on Celebrations and Orgies)
∂16-Mar-84 2216 ARK For your information
∂16-Mar-84 2138 ARK Online searching of technical reports list
To: ME@SU-AI.ARPA
CC: ARK@SU-AI.ARPA, Wiederhold@SUMEX-AIM.ARPA,
Library@SU-SCORE.ARPA, C.Chick@LOTS-A
A while ago I asked you about using the NS program for searching the
technical reports list, and you gave a helpful and informative answer.
Sometime next week, we will get the data on tape from ITS (CIT), and I'll
have better knowledge of its size. If we were going to use the NS and
INDEX programs, it makes sense to put it on SAIL. What do you think of
using some space for that (and writing it off as overhead)? Would you be
willing to offer some assistance in bringing it up? We haven't yet made
any decisions, but it does seem like 1022 is overly restrictive for this
kind of data. Thanks for your help.
Could I put it on [LIB,DOC] for a while, or is there a better place for it?
(We'll first restore it to SCORE, but I'd rather play with it on SAIL.)
Arthur
∂17-Mar-84 0842 Solomon.Datanet@MIT-MULTICS.ARPA history of the computer
Received: from MIT-MULTICS.ARPA by SU-AI.ARPA with TCP; 17 Mar 84 08:41:29 PST
Acknowledge-To: Solomon@MIT-MULTICS.ARPA
Date: Sat, 17 Mar 84 11:37 EST
From: Solomon@MIT-MULTICS.ARPA (Richard Jay Solomon)
Subject: history of the computer
To: jmc@SU-AI.ARPA
Message-ID: <840317163733.224912@MIT-MULTICS.ARPA>
With Ithiel gone now I have to make some decisions on where the project
will go in the future. While the computer people here are interested in
seeing it continue, there doesn't seem to be anyone who wants to take
Ithiel's place as director. I may be a grantee without a home for the
grant. Perhaps you have some ideas abot ut what I can do? We should
talk by phone. when is a good time to call?
Richard Solomon
Solomon@MIT-MULTICS.ARPA
history of the computer
Do not call before 10am Pacific Time. My phone numbers are
(work: 415 497-4430) (home: 857-0672). However, at the moment
I have no useful ideas that you won't have thought of. It isn't
something I can get personally involved in. Well maybe I have
a few ideas.
∂17-Mar-84 0942 MDD mail@
Thank you. I guess I was confused by VMS SDMAIL in which
what I did would have worked.
∂17-Mar-84 1337 CLT
no, thank you
∂17-Mar-84 1822 reiter%ubc.csnet@csnet-relay.arpa disjunctions
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 17 Mar 84 18:22:12 PST
Received: by csnet-relay via ubcpob; 17 Mar 84 21:11 EST
Date: Sat, 17 Mar 84 18:03:31 pst
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8403180203.AA13743@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA13743; Sat, 17 Mar 84 18:03:31 pst
To: JMC%su-ai.arpa@csnet-relay.arpa
Subject: disjunctions
Dear John
Thanks for your proof on circumscribing an existential. I now see what I
overlooked.
Re a convincing example where circumscription yields a disjunction. How about
the following:
In a taxonomy we usually have a number of necessary conditions on a class, e.g.
DOG(x) --> MAMMAL(x)
CAT(x) --> MAMMAL(x)
etc.
If we have reason to believe that our taxonomy exhausts the class of mammals,
we can circumscribe the predicate MAMMAL to obtain
MAMMAL(x) --> DOG(x) V CAT(x) V...
Is this the kind of example you were seeking?
Regards, Ray.
PS The search continues for a proof that circumscription cannot yield new
inequalities. The old "proof" failed for theories without minimal models. We
conjecture that universally quantified Horn theories always have minimal
models and therefore for such theories, circumscription yields nothing new
about inequalities.
"reiter%ubc.csnet"@csnet-relay.arpa
example
Thanks. I think that example will do. The result you already have
looks pretty strong.
∂17-Mar-84 2113 SJG
Dear John -
Thanks for the copy of Reiter's note. Boy, is that ever opening a can
of worms.
It follows from the fact that
bird(x) ∧ ¬ab(x) → fly(x)
that
bird(x) ∧ ¬ab(x) → ¬ostrich(x).
It seems likely to me that, for each specific type of bird, we will have
that a bird is not of that type specifically unless it is abnormal in
some fashion. If we can really circumsribe to get a disjunction, then
we will circumscribe to get
bird(x) → ab1(x) ∨ ab2(x) ∨ ... ∨ abn(x)
and I do not think that we really look at things this way.
Bear in mind, though, that I am writing this reply about 20 seconds
after reading your message (since I have to get back home soon and am
leaving for a trip round California tomorrow), so I may change my mind in
a day or two. For the moment, though, I have to remain unconvinced.
Let me keep thinking about it.
Your copy of Rich is on the desk in my office - I tried to buy one
from the bookstore; no luck. If I don't manage to see you the day I am
here before heading off to Oxford, ave a pleasant month; I'll see you
soon.
All my best,
Matt
Please MAIL me your schedule of when you will be here and when away.
∂17-Mar-84 2312 LLW@S1-A.ARPA Dave Poole
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 17 Mar 84 23:12:13 PST
Date: 17 Mar 84 2309 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Dave Poole
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂04-Mar-84 1317 JMC@SU-AI Dave Poole
Received: from SU-AI by S1-A with TCP/SMTP; 4 Mar 84 13:16:50 PST
Date: 04 Mar 84 1316 PST
From: John McCarthy <JMC@SU-AI>
Subject: Dave Poole
To: llw@S1-A
I heard a rumor that Foonly was going out of business and that he was
looking for a job. If there is any match between what he would like to
do and the S-1 Project, I would recommend him. Since he would be leaving
the business world for more steady income and less business hassles, he
might also be a stabilizing influence.
[John: Thanks very much for the suggestion. I'm following up on
it. If you happen to run into Dave, please encourage him to seriously
consider joining us. Thanks, Lowell]
llw%s1
Poole
Poole called me twice in the last week with what seems to me like
a last ditch effort to sell his shiny new F1 system. Were I in the
market for a TOPS-20, it might well be a good buy, but I don't think
he'll succeed.
Poole see Foonly, (beeper: 363-3038, after answer dial my number)
Foonly 969-7815
(home: 941-7563)
120 Monroe Drive, Palo Alto 94306
∂18-Mar-84 0321 ARK SAIL vs. SCORE vs. UNIX
To: Reges@SU-SCORE.ARPA, Golub@SU-SCORE.ARPA, JMC@SU-AI.ARPA,
Ullman@SU-SCORE.ARPA, Bureaucrat@SU-SCORE.ARPA
CC: ARK@SU-AI.ARPA
I believe that there is academic benefit to having students learn about
different operating systems if they are so inclined. In the Computer
Science Dept., we are quite fortunate to have UNIX (on many VAXen,
including NAVAJO), WAITS (SAIL), and TOPS-20 (LOTS-A, LOTS-B, and SCORE).
Students get some access to TOPS-20 on LOTS-A and LOTS-B. The CS Dept.,
however, has essentially forced all of its students on SCORE, and is
making it deliberately difficult for students to use SAIL in addition to
or instead of SCORE. Perhaps this is because SCORE has software for
limiting computer charges and SAIL doesn't. However, we are overriding a
definite educational benefit for purely monetary considerations.
John McCarthy has proposed that students can do projects supervised by the
bureaucrats for subsidized computer time. Since these projects would
inure to the benefit of CSD-CF, such subsidization would be overhead and
not come from CSD's unrestricted funds. This seems like an eminently
reasonable approach, and I encourage its consideration as a way to provide
for a valid educational objective while ameliorating financial
considerations. Thank you for your time and interest.
Arthur
It seems to me that your memo is capable of being misunderstood and
needs clarification. You should be explicit that the projects in question
involve improving CSD-CF for all users and are not the students' own
research and that the payoff for the student is computer time that he
can use for his own research.
∂18-Mar-84 0947 CLT
we have tickets for the ballet tonight (8pm opera house)
do you wish to go?
∂18-Mar-84 1848 SJG schedule
present best guess is as follows:
depart for Yosemite 3/18
return from Yosemite 3/23
depart for England 3/25
return from England 4/18
spend about two weeks in England, approx. 6/15 - 6/30
then Stanford for the summer (i.e., until I am kicked out or find
someone to pay me to think about these strange things); bicycle trip
currently abandoned so that we can find Sally a job.
I've thought about taxonomy a bit more. Independent of the merit of
my earlier arguments, I do not think I would WANT to be able to
derive
mammal(x) → dog(x) ∨ cat(x) ∨ ...
I don't know whether there is an exhaustive list of the mammals (sinne
new ones are regularly being discovered); if there were, I would want
to store that as a special fact (e.g., there will be no new types of
mammals). And I certainly know that I will never be able to enumerate
all mammal types...
Matt
P.S. I would not be at all surprised if my upcoming trip to the U.K.
were to be cut short or not to happen at all.
∂18-Mar-84 1944 PACK@SU-SCORE.ARPA Office, Admission
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Mar 84 19:31:41 PST
Date: Sun 18 Mar 84 19:30:59-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Office, Admission
To: jmc@SU-AI.ARPA
I spoke with Matt Ginsberg -- he is only going to be gone for the
beginning of the quarter and his office won't be available for me. Is
there any possibility of my claiming an office on the strength that I
have been admitted to the PhD program?
As far as the PhD program goes, I intend to accept the offer. I have
not yet decided whether to work for you or as an honors coop at SRI.
It depends largely on what I would be required to do at SRI, and how
open they are to various research topics -- I certainly don't want to
be told what my thesis is to be. I will talk with Nils this week and
come to a decision soon.
-Leslie
-------
I'll see what I can do about an office.
∂18-Mar-84 2249 ARK ∂18-Mar-84 2128 FEIGENBAUM@SUMEX-AIM.ARPA Re: For your information
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Mar 84 21:28:44 PST
Date: Sun 18 Mar 84 21:28:47-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: For your information
To: WIEDERHOLD@SUMEX-AIM.ARPA, ARK@SU-AI.ARPA
cc: ME@SU-AI.ARPA, olumi@SU-SCORE.ARPA, patterman@SUMEX-AIM.ARPA
In-Reply-To: Message from "Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>" of Sat 17 Mar 84 12:34:24-PST
No comments in particular. Just: stay away from SAIL!
Ed
-------
Reply:
FEIGENBAUM@SUMEX-AIM,WIEDERHOLD@SUMEX-AIM/cc,ME,olumi@SU-SCORE,patterman@SUMEX-AIM
Re: For your information
I don't see what your complaint is against SAIL. I suppose that similar
arguments can be made for SCORE (TOPS-20) or your favorite VAX running
UNIX. It is my belief that we could have the stuff working on more than
one computer, but that it is probably easiest to get a first approximation
on SAIL using the NS software. Would you rather it be done on SAIL first
and then later elsewhere, or instead do it somewhere else later without
the experience of the SAIL implementation?
I don't suppose you like the software at SAIL that notifies you of new things
(currently news stories) of interest.
Arthur
∂19-Mar-84 0036 ARK FYI
∂18-Mar-84 2128 FEIGENBAUM@SUMEX-AIM.ARPA Re: For your information
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Mar 84 21:28:44 PST
Date: Sun 18 Mar 84 21:28:47-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: For your information
To: WIEDERHOLD@SUMEX-AIM.ARPA, ARK@SU-AI.ARPA
cc: ME@SU-AI.ARPA, olumi@SU-SCORE.ARPA, patterman@SUMEX-AIM.ARPA
In-Reply-To: Message from "Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>" of Sat 17 Mar 84 12:34:24-PST
No comments in particular. Just: stay away from SAIL!
Ed
-------
Reply:
FEIGENBAUM@SUMEX-AIM,WIEDERHOLD@SUMEX-AIM/cc,ME,olumi@SU-SCORE,patterman@SUMEX-AIM
Re: For your information
I don't see what your complaint is against SAIL. I suppose that similar
arguments can be made for SCORE (TOPS-20) or your favorite VAX running
UNIX. It is my belief that we could have the stuff working on more than
one computer, but that it is probably easiest to get a first approximation
on SAIL using the NS software. Would you rather it be done on SAIL first
and then later elsewhere, or instead do it somewhere else later without
the experience of the SAIL implementation?
I don't suppose you like the software at SAIL that notifies you of new things
(currently news stories) of interest.
Arthur
∂19-Mar-84 0037 ARK FYI2
∂19-Mar-84 0026 WIEDERHOLD@SUMEX-AIM.ARPA Re: For your information
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 00:26:16 PST
Date: Mon 19 Mar 84 00:26:03-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: For your information
To: ARK@SU-AI.ARPA
cc: FEIGENBAUM@SUMEX-AIM.ARPA, ME@SU-AI.ARPA, olumi@SU-SCORE.ARPA,
patterman@SUMEX-AIM.ARPA
In-Reply-To: Message from "Arthur Keller <ARK@SU-AI.ARPA>" of Sun 18 Mar 84 22:48:00-PST
I think I can speak for Ed:
A system which can only be used effectively from hard-wired or modified
terminals lacks one important aspect of an information system: getting
data WHERE it is needed. ( it's fine for computation )
. Gio
-------
∂19-Mar-84 0944 ZAUDERER@SU-SCORE.ARPA comp. comm. mtg.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 09:44:46 PST
Date: Mon 19 Mar 84 09:44:03-PST
From: Shanee Zauderer <ZAUDERER@SU-SCORE.ARPA>
Subject: comp. comm. mtg.
To: jmc@SU-SCORE.ARPA
cc: lamping@SU-SCORE.ARPA
Stanford-Phone: (415) 497-3125
Your co-person said he could attend a mtg. morning or afternoon on
Mar. 29 or 30 or April 2 or 3. The mtg. will be maximum 1 1/2 hrs with
Rob. Could you select a time and let me know. Thanks,
-------
How about Thursday, Mar 29 at 2pm? April 3 is not possible.
∂19-Mar-84 1108 LAMPING@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 11:08:15 PST
Date: Mon 19 Mar 84 11:07:20-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA, Zauderer@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 19 Mar 84 11:03:00-PST
Thursday at 2:00 is fine with me. Please ignore my previous message
about Monday.
-------
∂19-Mar-84 1109 LAMPING@SU-SCORE.ARPA Comp
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 11:09:19 PST
Date: Mon 19 Mar 84 11:08:28-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Comp
To: JMC@SU-AI.ARPA
Shall we plan to talk about it tommorrow (Tuesday) afternoon?
-------
Thursday afternoon would be better. How about 1:30?
∂19-Mar-84 1112 ZAUDERER@SU-SCORE.ARPA Mtg.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 11:12:14 PST
Date: Mon 19 Mar 84 11:11:31-PST
From: Shanee Zauderer <ZAUDERER@SU-SCORE.ARPA>
Subject: Mtg.
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-3125
Thank you for your response, I'll give it to Rob. and send you back a
confirmation.
-------
∂19-Mar-84 1115 LAMPING@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 11:15:27 PST
Date: Mon 19 Mar 84 11:14:43-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 19 Mar 84 11:13:00-PST
I will be in LA on Thursday. Any other day would be OK.
-------
How about Friday at 4pm?
∂19-Mar-84 1118 GROSOF@SUMEX-AIM.ARPA circumscription
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 11:18:32 PST
Date: Mon 19 Mar 84 11:18:23-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: circumscription
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA, genesereth@SUMEX-AIM.ARPA
Hello John,
I think I've got a real result: all of Reiter's default logic can be
elegantly described as circumscription. I've done some examples and
developed some notation, especially for inheritance hierarchies with
exceptions. I've written up most of it in longhand form (convenient for
diagrams etc.). If you could take a look at it before our meeting at 4
this afternoon I'd greatly appreciate it! Also, I've made some copies of
background articles for you; I thought you might be interested. All of this
is in your 2nd floor mailbox as of 11:45 pm.
Benjamin
-------
∂19-Mar-84 1137 GROSOF@SUMEX-AIM.ARPA corection
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 11:37:24 PST
Date: Mon 19 Mar 84 11:37:12-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: corection
To: jmc@SU-AI.ARPA
11:45 Am.
-------
∂19-Mar-84 1354 DFH Elliott Blum called
28-2469 until 4:15 pm
∂19-Mar-84 1411 YAO@SU-SCORE.ARPA possible appointment
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 14:11:22 PST
Date: Mon 19 Mar 84 14:05:34-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: possible appointment
To: JMC@SU-SCORE.ARPA
cc: yao@SU-SCORE.ARPA
John,
Would you be around on March 26? If you have free time, I would like to
make an appointment with you for a friend, Dr. Patricia Cheng, who is
a psychologist, and who is interested in the AI program and research
work here at Stanford.
Please let me know. Thanks.
Andy
-------
yao%score
cheng
I could see her at 3pm, but probably I'm not the right person for her.
There are other people in AI, e.g. Feigenbaum, who have had more
contact with the Stanford psychologists than I have. Also there
is considerable interaction through CSLI, and the right person to
inquire of there is probably John Perry.
Perry, John JRP@sri-ai 28 7-1275 28 327-0649 (HM)
∂19-Mar-84 1539 LAMPING@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 15:39:12 PST
Date: Mon 19 Mar 84 15:38:28-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 19 Mar 84 11:59:00-PST
Very good. I'll come to your office then with questions in hand.
-------
∂19-Mar-84 1621 JK proposal
To: "@SATO.DIS[1,CLT]"
The proposal is more or less on its way to Washington.
Sato sent me his comments - he liked it modulo a few minor corrections.
∂19-Mar-84 1657 YAO@SU-SCORE.ARPA Re: cheng
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 16:57:08 PST
Date: Mon 19 Mar 84 16:56:13-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: Re: cheng
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 19 Mar 84 14:22:00-PST
Thanks for the pointer. I will take her to see you at 3 anyway.
Andy
-------
∂19-Mar-84 2343 HST pictures concerning lisp history
it would be nice if you peep into your stock of old pictures.i would like
tpresent some in my invited talk at austin.
what is the mail address of raphael?
∂20-Mar-84 1058 DFH Colin Mick phoned
please call him at 856-3666
∂20-Mar-84 1222 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, March 23, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 Mar 84 12:20:00 PST
Date: Tue 20 Mar 84 12:15:35-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -- Friday, March 23, 1984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
Friday, March 23, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: Hisao Yamada
Department of Information Science
Faculty of Science, University of Tokyo
TOPIC: A Cerebral View of Task Optimality
in Japanese Text Typing
ABSTRACT:
We discuss an activity of typists' brains during touch typing, based
on knowledge of experimental psychology and cerebral physiology,
especially in connection with the functional laterization of cerebral
hemispheres. Our hypothesis is that a skilled copy typist depends
heavily on the cortical reflex in response to direct visual
information from a manuscript, but depends less on the linguistic
facility of the left hemisphere. As an indication of the validity of
the hypothesis, we report our results of the measurements of typists'
electroencephalograms (EEG) during Japanese touch typing. Our
findings are preliminary but they are compatible with the hypothesis.
Whereas the current AI efforts are mainly focusing their attention on
the logical reasoning aspect of our intellectual activities which is a
dominant function of the left cerebral hemisphere, the present
investigation concerns itself with a subconscious, intuitive and
reflexive function of our mind, for which the right cerebrum is
dominant.
A short introduction to Japanese input techniques is also included.
The talk is profusely illustrated with slides.
-------
∂20-Mar-84 1310 PJB@S1-A.ARPA
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 20 Mar 84 13:01:58 PST
Date: 20 Mar 84 1258 PST
From: Paula Bauman <PJB@S1-A.ARPA>
To: jmc@SU-AI.ARPA
∂20-Mar-84 1214 JMC@SU-AI.ARPA
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 20 Mar 84 12:14:05 PST
Date: 20 Mar 84 1201 PST
From: John McCarthy <JMC@SU-AI.ARPA>
To: pjb@S1-A.ARPA
I plan to be at the Lowell, Rod and Mike party Saturday.
[Thanks, I'll let Lowell know. -Paula]
∂20-Mar-84 1315 GROSOF@SUMEX-AIM.ARPA circumscription and default logic
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 Mar 84 13:14:53 PST
Date: Tue 20 Mar 84 13:14:59-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: circumscription and default logic
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA
Hi John,
I managed to connect with Reiter on the phone this morning
for half an hour. He said that my approach sounds good, and confirms
his feelings about the relation of default logic to circumscription.
But it seems to be new.
In general he was encouraging. The deadline for submitting abstracts
for the Workshop has been extended tothe end of April. He said he'd like to
read whatever I get written.
Etherington is working on trying to show that circumscription
CANNOT hadle equality and unique names. Reiter pointed out that since
default logic can, I should try my approach on it. I will. He and
Etherington would appreciate prompt report of either positive or negative
progress on equality and unique names, since Etherington is actively
pursuing it.
Reiter agreed that Doyle's reasoned assumptions stuff is just
default logic. (One more down in trying to unify nonmonotonic reasoning
approaches!).
As far as general default rules go, Reiter commented neither
he nor Criscuolo nor anyone else that he knows of have found any use
for non- seminormal defaults, and moreover he has very little intuituion
on them.
Also, he recommends using a different net address than you have:
reiter@rutgers
I'll keep you posted of further developments....
Regards,
Benjamin
-------
∂20-Mar-84 1556 GROSOF@SUMEX-AIM.ARPA unique names and equality
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 Mar 84 15:56:48 PST
Date: Tue 20 Mar 84 15:56:54-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: unique names and equality
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA
Hi John,
This may be very naive, but how about the following:
Reiter proposes to handle circumscribing inequality using
a default rule:
: Not-equal(x,y)
-------------------------
Not-equal(x,y)
I guess this is universally quantified to the left, i.e.
: NE(x,y)
ALL x,y. --------------
NE(x,y)
Using my mapping from default logic to circumscription, we can
describe this seminormal default rule as:
ALL x,y. ~ab[nNE](x,y) => NE(x,y)
This provides a single axiom in first order to handle inequality.
We then circumscribe ab[nNE], which is just a predicate.
Alternatively, we could think of this as circumscribing ab in a
more general context, where the above is rewritten:
ALL x,y. ~ab (aspect[nNE](x,y)) => NE(x,y)
"nNE" refers to "null antecedent, NE consequent" in line with the
indexing notation [a,w] I used in what I showed you yesterday.
The index doesn't matter. We could just write:
"ab1" or "ab (aspect1"
instead. The reason I included it, however, is to point out that we can
combine the inequality default, i.e. equality circumscription, with other
defaults/ circumscription.
What do you think?
--Benjamin
-------
∂20-Mar-84 1557 GROSOF@SUMEX-AIM.ARPA nonmon. seminar for spring
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 Mar 84 15:57:42 PST
Date: Tue 20 Mar 84 15:57:53-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: nonmon. seminar for spring
To: jmc@SU-AI.ARPA
Hi John,
How about Joe Halpern as a speaker? He's been working on a
modal likelihood logic.
Benjamin
-------
∂20-Mar-84 1712 JMC Laura Breeden
She is the CSnet contact. Her address is breeden@CSNET-CIC
∂21-Mar-84 0022 ARK FYI
∂19-Mar-84 1611 WIEDERHOLD@SUMEX-AIM.ARPA [Martin Frost <ME@SU-AI.ARPA>: SAIL ]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Mar 84 16:11:35 PST
Date: Mon 19 Mar 84 16:04:55-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: [Martin Frost <ME@SU-AI.ARPA>: SAIL ]
To: ark@SU-AI.ARPA, feigenbaum@SUMEX-AIM.ARPA,
*"PS:<WIEDERHOLD>LIBRARY.PROJECT.1"@SUMEX-AIM.ARPA, olumi@SU-SCORE.ARPA
Return-Path: <ME@SU-AI.ARPA>
Received: from SU-AI.ARPA by SUMEX-AIM.ARPA with TCP; Mon 19 Mar 84 13:49:30-PST
Date: 19 Mar 84 1349 PST
From: Martin Frost <ME@SU-AI.ARPA>
Subject: SAIL
To: Wiederhold@SUMEX-AIM.ARPA
Is there a suggestion here that Sail is usable only from special types of
terminals? That's certainly not true.
A system which can only be used effectively from hard-wired or modified
terminals lacks one important aspect of an information system: getting
data WHERE it is needed. ( it's fine for computation )
Although the display service is available remotely only on terminals that
have certain capabilities (such as insert-delete), the system still works
from other types of terminals. Maybe you're under the impression that
only terminals with "EDIT" keys can use the Sail display service. That's
not true either. I'm not sure what your point is here.
I find it indeed very difficult to deal with the SAIL keysequences away from
a DATADISC. Do you use SAIL that way? The fact that something can be
done doent mean that it is pleasant, and we want to make the bibliography/
library services available to many folk. Gio
-------
Reply to:
Wiederhold%sumex,feigenbaum@SUMEX-AIM/cc,olumi@SU-SCORE,ME,Library%score
SAIL and the library's technical report list
I have used the SAIL display service from an unmodified Zenith. I would
have to say that it works but not as well as a terminal with an edit key.
Nonetheless, I believe that for the project we are contemplating, the
question is really moot. First, the news service programs can be used
quite effectively without using display service. If you don't use display
service, you don't have use for the features of a modified terminal.
Rather, you don't even use those features! There are considerable
simplifications in usage because the records are usually less than 10
lines long.
One thing of which you may not be aware is that Richard Manuck usually
uses SAIL as the first CSD machine that he puts the bi-monthly New Reports
List online. (He uses the DIAL program to transfer it from ITS. Does
your system have this facility? Is it as easy to use? Richard says that
the method he uses with SAIL's DIAL is significantly easier than the old
method he used in the past on SUMEX. He regularly lost chunks of data
using SUMEX, and has never lost any data using SAIL.) Richard then moves
the list to the other systems on which it resides. He could easily run an
easy-to-use program to supply the new data to the news service programs.
SAIL allows some things to be done while not logged in. SCORE allows
significantly fewer such things. You can look at files and search them
(if they are unprotected) at SAIL if you are not logged in. (However,
running the news service programs is currently not permitted when not
logged in.)
Clearly, people with SAIL accounts would have no problem accessing the
files effectively. There are several alternatives for people without
accounts on SAIL. We could encourage them to get accounts on SAIL (after
all, they would have to have accounts on SCORE if it were there). We
could have a program that runs on the user's computer that requests the
service from SAIL and keeps track of the charges that was incurred on the
user's behalf on SAIL. Alternatively, we could simply allow free and
unrestricted access to the data on SAIL until an equivalent system
appeared on SCORE. (Would the management of SCORE be willing to do that?)
There is no reason why we can't have the reports list up on more than one
system without much additional effort on the part of library personnel.
Why is there such an uproar about putting it on SAIL and narry a peep
about doing it on SCORE?
Thanks.
Arthur
∂21-Mar-84 1102 CLT okner
we have an appointment tomorrow at 3pm
we could do the data tonight after g&s (or before - it starts at 9pm)
∂21-Mar-84 1248 DEK T.
To: JEF@SU-AI.ARPA, JMC@SU-AI.ARPA, RPG@SU-AI.ARPA,
cheriton@SU-NAVAJO.ARPA
I spoke with him and am even more impressed than before. He will
arrive Sunday night and be with us Monday and Tuesday; lecture on
Tuesday afternoon. Phyllis is setting up all the necessary appointments;
tentatively he will meet with our committee as a whole from 2:30-3:30
on Monday afternoon. Jill and I will host a dinner party at our house
Monday night. I'll be sending an announcement to the faculty as a whole
later today.
I've also communicated with Nils, and it looks like his "turn" will be
the second week of April. (Especially since he will be rafting down
the Grand Canyon from April 20 to May 10 or something!) I have a phone
call in to Ken Kennedy, who will probably call me back this afternoon;
I think the third week of April will fit his schedule, but I'm not sure.
Both K. and N. are unavailable the first week in April, I believe.
∂21-Mar-84 1330 ullman@diablo Re: T.
Received: from SU-HNV.ARPA by SU-AI.ARPA with TCP; 21 Mar 84 13:30:08 PST
Date: Wed, 21 Mar 84 13:29 PST
From: Jeff Ullman <ullman@diablo>
Subject: Re: T.
To: DEK@Sail, JEF@Sail, JMC@Sail, RPG@Sail, cheriton@Navajo
Hmm. Holly pointed out that Dennis was the only one of
our candidates whose first name isn't a prefix of his last name.
Do you think there's any significance in that?
∂21-Mar-84 1628 DEK CHAIRPERSON SEARCH ENTERS CRITICAL PHASE!
To: "@FACULT.DIS[1,DEK]"@SU-AI.ARPA
On behalf of the Chairperson Search Committee, I'm pleased to report that
we received a dozen excellent applications, from which we have selected
three people for visits to the campus.
The first of these visits is imminent: Dennis Tsichritzis will be here
next Monday and Tuesday, March 26 and 27. (I'm sorry that I couldn't
arrange for more lead time; he must return to Europe soon, so this was
the only reasonable pair of days.) Nils Nilsson will be our guest on
Monday and Tuesday, April 9 and 10; and Ken Kennedy will be visiting us
on the following Monday and Tuesday, April 16 and 17.
These visits obviously will have a significant effect on the future of
our department, and I hope you will be able to help us make the best
choice. The candidates also will want to find out as much about us
as possible while they are here.
Each candidate will be giving a special lecture. The first of these,
entitled "Office filing and office mailing", will be by Dennis T.,
next Tuesday afternoon in Jordan at 4:15. (Note, NOT Terman!)
Besides this, the candidates will be at our regular Tuesday lunch;
there will be sandwiches available next Tuesday noon, even though
it's between quarters, because of Dennis's visit.
Many of you will also want to spend a few minutes meeting our visitors
personally. Please phone Phyllis (7-4367) for an appointment.
You might want to combine that with dinner at the faculty club;
I've left the Monday noons open for that.
And besides this, Jill and I will be hosting three dinner parties
on the respective Monday evenings, so that we can have informal
get-togethers. The first such gala occasion will be next Monday
evening, March 26, beginning at 6pm. [Our house is at 1063 Vernier
Place on campus.] You and your spouse/friend are cordially invited.
And that brings me to an important logistical point: I need to tell
the caterers soon (i.e., by Friday night) how many people to expect,
so that they can make the food. Therefore please RSVP to Phyllis
before, say, 4pm on Friday March 23, telling her if Jill and I should
expect 0, 1, or 2 people from your household. (I'm sorry that I wasn't
able to give more advance warning about this; I know that many of
you will have trouble arranging for baby sitters at such a late date.
Now if Iris can wait to have her baby until next Wednesday...)
OK, to summarize: Our search is entering its most important period.
I'm asking you to do this before Friday at 4pm: Call Phyllis to arrange
for a time to meet Dennis next Monday or Tuesday, and/or to RSVP
to the party invitation. Thanks for any help you can be to our search.
∂21-Mar-84 1639 DFH phone calls
Ben wants to see you anytime tomorrow to talk further about
circumscription & unique names. Could you send him a message
with a good time.
Kechris, Math Dept. Cal Tech 213-397-6975. Will try to call
you again Friday.
∂21-Mar-84 1816 PEREIRA@SRI-AI.ARPA [Chappell: Expenses for Victoria]
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 21 Mar 84 18:16:31 PST
Date: Wed 21 Mar 84 18:19:03-PST
From: PEREIRA@SRI-AI.ARPA
Subject: [Chappell: Expenses for Victoria]
To: jmc@SU-AI.ARPA
This is the estimated budget for Veronica's visit. She is now
intending to come in the week of the 9th of April, if that is OK with
you. Please let me know whether you have a suplementary source of
funds for this trip, or whether I should try to get the whole sum
through CSLI+SRI.
-- Fernando
---------------
Mail-From: CHAPPELL created at 21-Mar-84 18:01:33
Date: 21 Mar 1984 1801-PST
From: Chappell
Subject: Expenses for Victoria
To: pereira
cc: chappell
Fernando,
The following is an estimate of expenses for Victoria Dahl's
trip:
Airfare R/T 599.
Hotel 7days @ 43.40 303.80 (Mermaid Motel)
Car 1 week 129.00 (Budget Rental; unlimited mileage)
Meals
Breakfast 7 @ 3. 27.
Lunch 7 @ 10. 70.
Dinner 7 @ 15. 105.
------
Total $1,233.80
Let me know if I've forgotten anything. If you are going to submitt
this to Barbara, don't forget the form.
--Elsie
-------
-------
chappell@sri-ai,pereira@sri-ai
Veronica Dahl
Elsie, that's Veronica not Victoria. I can pay 1/3 of the expenses.
I suggest that one of the organizations pay (not mine) and tell my
secretary Diana Hall (DFH@SU-AI) what our share is. Do you have titles
and abstracts yet of talks she can give.
∂21-Mar-84 2106 JRP@SRI-AI.ARPA Victor Kuo
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 21 Mar 84 21:06:14 PST
Date: Wed 21 Mar 84 21:08:43-PST
From: John Perry <JRP@SRI-AI.ARPA>
Subject: Victor Kuo
To: jmc@SU-AI.ARPA
cc: stucky@SRI-AI.ARPA
He has applied to csli for a postdoc. He wasn't included among the winners,
but a negative decision was not really made either. He is so quiet that we
don't feel we know him very well, even though he has been coming to csli
events all year. His credentials are interesting. Can you tell us anything
about how he has interacted with you this year, and what you think of him,or
give us any advice?
-------
I'll phone you about Kuo, but I fear he is taking quite some time getting
used to this environment, so I haven't got a lot out of him either. I
suggest a long talk with him.
∂21-Mar-84 2252 cheriton@navajo Re: T.
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 21 Mar 84 22:52:03 PST
Date: Wed, 21 Mar 84 22:50 PST
From: David Cheriton <cheriton@navajo>
Subject: Re: T.
To: DEK@Sail, JEF@Sail, JMC@Sail, RPG@Sail, ullman@Diablo
Yes, and what about that fact that Mr. T. in the TV sub*culture is
on the A-team?
∂21-Mar-84 2338 PEREIRA@SRI-AI.ARPA Re: Veronica Dahl
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 21 Mar 84 23:37:52 PST
Date: Wed 21 Mar 84 23:40:26-PST
From: PEREIRA@SRI-AI.ARPA
Subject: Re: Veronica Dahl
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 21 Mar 84 19:49:00-PST
No, I don't have the titles but I'll get them tomorrow from Veronica.
I'll go ahead and deal with the rest of the bureaucracy, and let
your secretary after the expense forms are all in.
-- Fernando
-------
∂22-Mar-84 1008 DFH Prof. Slotnik called
from Univ. of Ill. 217-333-6726, or he will
try to call you here about 1:30
∂22-Mar-84 1009 DFH time off
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, yearwood@SU-SCORE.ARPA
I would like to take some extra time for lunch
tomorrow -- 11:45-2:00.
∂22-Mar-84 1146 DFH III planning comm.
Ron Paolucci wants to know if you could
attend April 10 rather than April 3 as
originally scheduled. 213 452 8875.
∂22-Mar-84 1317 DEK date change
To: "@FACULT.DIS[1,DEK]"@SU-AI.ARPA
It looks like Ken Kennedy will be with us on Tuesday and Wednesday,
April 17 and 18, instead of the corresponding Monday and Tuesday.
∂22-Mar-84 1430 STUCKY@SRI-AI.ARPA Victor Kuo
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 22 Mar 84 14:30:19 PST
Date: Thu 22 Mar 84 14:32:42-PST
From: Susan Stucky <Stucky@SRI-AI.ARPA>
Subject: Victor Kuo
To: jrp@SRI-AI.ARPA
cc: jmc@SU-AI.ARPA
I've sent a letter to Victor apologizing for the tardiness in coming
to a decision about his status as a postdoctoral fellow at CSLI. I
told him that a decision would be forthcoming in a couple of weeks,
thinking that he shouldn't be held off any longer than that and
anticipating that either one or both of you could find a chance to
talk with him during that time.
-Susan
-------
∂22-Mar-84 2130 FEIGENBAUM@SU-SCORE.ARPA review
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Mar 84 21:29:54 PST
Date: Thu 22 Mar 84 21:19:46-PST
From: Edward Feigenbaum <FEIGENBAUM@SU-SCORE.ARPA>
Subject: review
To: jmc@SU-AI.ARPA
John, that was good, solid, sensible review of the Fifth Generation book.
Many thanks!
Ed
-------
∂23-Mar-84 Newman.ES@PARC-GW.ARPA 23-Mar-84 JMC Relative merits of US & USSR foreign policy
Received: from PARC-GW.ARPA by SU-AI.ARPA with TCP; 23 Mar 84 11:44:41 PST
Received: from Concord.ms by ArpaGateway.ms ; 22 MAR 84 14:03:21 PST
Date: 22 Mar 84 13:24:18 PST (Thursday)
From: Ron Newman <Newman.es@PARC-GW.ARPA>
Subject: Relative merits of US & USSR foreign policy
To: Tony Siegman <SIEGMAN@SU-SIERRA.ARPA>
cc: JMC@SU-AI.ARPA, SU-BBoards@SU-AI.ARPA
In your message of 18 Mar 84 15:29:32-PST you state that "our system of
government and our behavior as a world power is a LOT better than theirs
[the USSR], and worth defending; and we'd better keep our guard up."
I certainly agree that our system of government is "a LOT better than
theirs." But I can't agree that our international conduct is any
better. We have a nasty habit of overthrowing or undermining any
government we don't happen to like. We did it in Iran and Guatemala in
1954; in Chile in 1973; in the Dominican Republic in 1965 or so; even in
Australia in the late 1970's (see the latest issue of Mother Jones). We
installed the Somoza dictatorship in Nicaragua. We tried and failed to
overthrow Castro by invasion in 1961, and we're trying to get rid of the
Sandinistas in Nicaragua right now. Furthermore some of the governments
that we support (Chile, El Salvador, Guatemala, the Philippines) are the
kind of people we fought World War II to stop.
If you put that record up against Soviet misbehavior in Czechoslovakia,
Hungary, Poland, East Germany, Afghanistan, and the rest of the
well-known list, wouldn't you say the scales are pretty balanced?
/Ron
∂24-Mar-84 0035 GROSOF@SUMEX-AIM.ARPA nonmonotonic reasoning seminar
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Mar 84 00:35:16 PST
Date: Sat 24 Mar 84 00:35:26-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: nonmonotonic reasoning seminar
To: jmc@SU-AI.ARPA
cc: genesereth@SUMEX-AIM.ARPA
Hi John,
Below is a draft of an announcement of the nonmonotonic seminar proposal.
I have taken the liberty of speculating as to possible topics. Circumscription
appears to be heavily represented. I'd like your comments, especially with
regard to speakers and topics. The parts with question marks I will include
only in a limited distribution to potential speakers. The more
general-distribution announcement will of course be briefer and more
circumspect than to include the speculations herein.
Especially, what do you think of my speculations as to topics for you, Reiter
Etherington, and Leslie Pack?
--Benjamin
John McCarthy has asked me to try to arrange a seminar in
nonmonotonic reasoning for this spring. I was thinking along the
lines of meeting once every one or two weeks.
Below is a list of possible speakers and topics. Only the first <three>
speakers (and not even their topics) are more than hypothetical at this
point, since they haven't even been approached yet.
Please respond if you are interested, and indicate what your interests are.
Suggestions (and especially offers) with respect to speakers and topics are
of the highest priority, and are greatly appreciated.
----------------------------------------------------------------------------
John McCarthy of Stanford:
(?) applying circumscription to formalizing common-sense knowledge;
the unique names problem;
taxonomizing nonmonotonic and default reasoning
Raymond Reiter } of University of British Columbia, Vancouver
David Etherington }
<they will be visiting Stanford sometime this spring, probably late April>
(?) seminormal default logic;
inheritance hierarchies with exceptions;
circumscription vs. default logic;
the unique names problem
Benjamin Grosof of Stanford
(?) simulating default logic with circumscription;
partial circumscription and predicate completion
Patrick Hayes of <?>
<he will be visiting CSLI in May>
(?)
Robert Moore of SRI
(?) autoepistemic nonmonotonic modal logic
Leslie Pack of Stanford
(?) using circumscription to formalize blocks world situations
Vladmir Lifschitz of University of Texas, El Paso
(?) circumscription of multiple predicates
Joe Halpern of IBM San Jose
(?) logic of likelihood
Kurt Konolige of SRI
(?) formalizing resource-limited reasoning
-----------------------------------------------------------------------------
-------
∂25-Mar-84 1802 SJG schedule
I will now be in England for the period April 18 - 29, and in Stanford
otherwise until mid June...
Matt
∂25-Mar-84 1951 SGF terminal
Barwise and Perry have convinced me that it would be better to shift to
their computer and one of their terminals when I return in the summer.
I understand that all the files I currently have can be automatically
transferred at that point. However I suppose my Sail account should be
kept open until then. It would be most convenient if you , or someone
acting on your behalf, could come and get the terminal sometime this
Wednesday, preferably by 1 P.M.
I think you said that should not be too much trouble.
I awant to thank you for the extended loan of the terminal. It has been
very useful and has served as a good introduction to the possibilities
of such an apparatus. Thanks again for all your help and initial advice.
Please let me know when the terminal will be picked up. Sol
∂25-Mar-84 2247 FEIGENBAUM@SUMEX-AIM.ARPA SCIENCE, 23 Mar. 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 Mar 84 22:47:30 PST
Date: Sun 25 Mar 84 22:40:03-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: SCIENCE, 23 Mar. 1984
To: hpp@SUMEX-AIM.ARPA, su-bboards@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, krd%mit-oz@MIT-MC.ARPA
The aforementioned issue of SCIENCE has a "feature story" on knowledge-
based systems in general and expert systems in particular (p1279-1282),
with various luminaries and their luminary programs mentioned. Pretty
good article.
Ed Feigenbaum
-------
I saw it. Thanks.
∂26-Mar-84 0930 DKANERVA@SRI-AI.ARPA
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 26 Mar 84 09:29:58 PST
Date: Mon 26 Mar 84 09:31:49-PST
From: DKANERVA@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
cc: DKanerva@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 23 Mar 84 18:36:00-PST
The reports aren't back from the printer yet, but I'll send you copies
of reports 2 and 4 as soon as they are available.
Dianne
-------
∂26-Mar-84 0933 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT---There will be NO Siglunch on Friday, March 30≠
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 26 Mar 84 09:33:49 PST
Date: Mon 26 Mar 84 09:29:16-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT---There will be NO Siglunch on Friday, March 30≠
To: SIGLUNCH@SUMEX-AIM.ARPA
-------
∂26-Mar-84 1051 DHM thanks
To: JMC
CC: DHM
John,
Carolyn mentioned to me your generous offer to pick up my SAIL costs if I
can't find anyone else to support my research. I'm talking to a number of
potential patrons whose interests are closer to mine, but at the moment
it's difficult to predict the outcome of our negotiations. I hope that I
won't have to take you up on your offer, but it's very reassuring to me to
know that there will be a way for me to continue my work on SAIL, since
transporting it elsewhere would be very inconvenient at this stage.
Thanks again.
Dave.
∂26-Mar-84 1133 BERG@SU-SCORE.ARPA grades
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Mar 84 11:32:59 PST
Date: Mon 26 Mar 84 11:30:16-PST
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: grades
To: rod@SU-AI.ARPA
cc: feigenbaum@SU-SCORE.ARPA, abraido@SU-SCORE.ARPA, pack@SU-SCORE.ARPA,
herriot@SU-SCORE.ARPA, reid@SU-GLACIER.ARPA, trattnig@SU-SCORE.ARPA,
schreiber@SU-SCORE.ARPA, wiederhold@SU-SCORE.ARPA, zm@SU-AI.ARPA,
cab@SU-AI.ARPA, shortlieffe@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA,
papa@SU-SCORE.ARPA, cheriton@SU-HNV.ARPA, winograd@SU-SCORE.ARPA,
pratt@SU-NAVAJO.ARPA, yearwood@SU-SCORE.ARPA, berg@SU-SCORE.ARPA
Stanford-Phone: (415) 497-4776
As previously noted, grades for winter quarter courses are due today.
If the end of quarter reports are not turned in by the deadline,
students will receive a grade of "incomplete" on their records.
Thus some students planning to graduate winter quarter will be unable
to do so, because his grade was not reported on time.
Please turn the end of quarter reports in as soon as possible. Put
them in my mailbox, or bring them to my office (256 mjh) today, or
tomorrow before 10 (at the latest).
Thank you for your kind attention to this request.
Kathy
-------
∂26-Mar-84 1136 AAAI-OFFICE@SUMEX-AIM.ARPA '84 AAAI budget
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 26 Mar 84 11:36:20 PST
Date: Mon 26 Mar 84 11:35:55-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: '84 AAAI budget
To: jmc@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Here is a draft version of the '84 budget. If you have any questions
about it, pls ask.
Claudia
Version:1984.3
BALANCE SHEETS for the YEARS
1980, 1981, 1982, 1983 and 1984 (projected)
1980 1981 1982 1983 1984
------------------------------------------------------------------------
ASSETS
Current Assets 36,799 69,940 150,850 479,421 569,423
Fixed Assets 116 0 3,556 15,270 16,431
TOTAL ASSETS 36,915 69,940 154,406 494,742 585,854
LIABILITIES
Current Liabilities 0 0 1,821 (1,438) (2,158)
Fund Balance 36,915 75,572 152,584 496,180 588,012
36,915 ( 5,631) 154,406 494,742 585,854
-1-
!
MEMBERSHIP COST CENTER
ACTUAL BUDGET ACTUAL BUDGET
1982 1983 1983 1984
---------------------------------------------------------------------------
Membership
----------
Dues 31,461 31,441 83,766 85,000
Sale of Mailing
list 960 4,800 3,700 4,070
Total Revenues 32,421 36,241 87,465 89,070
Refunds ( 912) ( ) ( 280) ( 300)
Postage (3,202) ( 4,500) (2,828) (3,200)
Printing ( 558) ( 2,500) (4,377) (5,000)
Misc ( 61) ( ) ( 689) ( 750)
AAAI labor (9,484) (13,800) (15,103)(13,035)
office expenses (5,219) (2,898) ( 7,854)( 6,562)
Total Expenses (19,536) (23,698) (31,131) (28,247)
MEmbership, gross
margin 12,885 12,543 56,334 60,223
AI Magazine
Advertising 4,546 12,000 24,563 28,000
Total Revenues 4,546 12,000 24,563 28,000
L. Robinson
(35% gross) (1,410) (4,200) ( 6,626) n/a
Misc (1348) 0 ( 468) ( 500)
Printing (12,939) (20,000) (28,396)(38,000)
Typesetting,
graphics (5,250) (10,000) ( 8,896) (9,000)
Mailing (3,724) (8,000) ( 7,749) (9,000)
AAAI Labor (5,419) (11,000) ( 8,631) (8,710)
Office exp (2,982) ( 1,320) ( 4,788) (4,922)
Total Expenses (33,072) (54,520) (65,554) (70,132)
AI Magazine,
gross margin (28,526) (42,520) (40,991) (42,132)
MEMBERSHIP,
GROSS MARGIN (15,641) (29,977) 15,343 18,091
3
!
AAAI CONFERENCE COST CENTER
ACTUAL BUDGET ACTUAL BUDGET
1982 1983 1983 1984
---------------------------------------------------------------------------
Registration
fees 126,247 135,000 188,450 222,000
(1982 fig
incl banquet)
Banquet 0 25,000 20,000 18,000
T-Shirts 2,500 3,450 4,500 4,500
Total Revenues 128,247 163,450 212,950 244,700
Facilities ( 14,532) 0 ( 1,224)( 7,000)
Refunds ( 5,489) ( 9,502)(10,000)
Catering* (23,330) (23,148) (30,622)(25,000)
Program
Committee ( 6,172) (10,000) ( 7,084)(12,000)
Advertising 0 (10,000) ( 2,704)( 4,500)
Postage ( 4,900) ( 6,000) (17,464)(12,000)
Conf Packets ( 3,974) (3,000) (11,035)(10,500)
Travel (3,676) (5,000) ( 4,672)( 6,000)
A/V (1,238) (5,000) (11,430)( 6,000)
Printing (8,267) (16,229) (23,087)(15,000)
Design, Type-
setting (1,810) (4,024) ( 6,042)( 4,500)
Banquet (13,875) (25,000) (19,359)(18,000)
Shuttle Buses 0 0 0 (15,000)
Contract Labor 0 0 0 (11,000)
AAAI Labor (21,677) (30,800) (34,556)(36,360)
Office exp (11,929) (14,784) (16,656)(18,702)
Total Expenses (120,869) (146,735) (196,760)(211,562)
CONFERENCE,
GROSS MARGIN 7,378 10,465 16,190 33,138
* Late '82 expenses
4
!
AAAI TUTORIAL COST CENTER
ACTUAL BUDGET ACTUAL BUDGET
1982 1983 1983 1984
-------------------------------------------------------------------------
Tutorial Fees 169,042 162,000 311,195 225,000
TecH Transfer
Symposium 0 52,500 98,251 n/a
(300@$175)*
Total Revenues 169,042 214,500 409,446 225,000
Lecturers'Fees ( 32,040) (31,000) ( 66,571) ( 56,000)
(tutorials)
Lecturers' Fees* 0 (6,000) ( 6,100) ( 0)
(tech transfer)
L. Robinson
(10% gross) (16,146) (13,500) ( 33,285) n/a
Printing of
Syllabuses (14,588) (11,740) (12,279) (13,000)
Refunds ( 8,260) ( 9,000)
Supplies ( 168) ( 200) ( 174) ( 0 )
AAAI Labor (1,806) (5,000) ( 2,879) ( 963)
Office Exp ( 994) ( 200) ( 1,388) ( 820)
Total Expenses (65,742) (80,765) (130,937) ( 79,783)
TUTORIAL,
GROSS MARGIN 103,300 146,860 203,227 145,217
* New entry
5
!
AAAI EXHIBIT COST CENTER
ACTUAL BUDGET ACTUAL BUDGET
1982 1983 1983 1984
-----------------------------------------------------------------------
Booth Fees 20,440 25,000 33,740 49,700
Total Revenues 20,440 25,000 33,740 49,700
Space Rental ( 559) ( 2,000) (5,614) ( 0)
Security 0 (3,000) (1,645) (1,500)
Exhibit PR
materials ( 918) 0 (1,018) ( 600)
Mailing ( 38) 0 ( 684) ( 500)
L. Robinson
(25% gross) ( 6,769) (5,208) ( 5,614) n/a
UT Electricians (5,000)
AAAI labor ( 4,516) (8,100) ( 7,199) (1,925)
Office Expenses (2,485) ( 810) ( 3,470) (1,641)
Total Expenses (15,285) (19,118) (25,244) (11,166)
EXHIBIT, GROSS
MARGIN 5,155 5,882 8,496 38,534
6
!
PUBLICATION COST CENTER
ACTUAL BUDGET ACTUAL BUDGET
1982 1983 1983 1984
-----------------------------------------------------------------------
Sale of AI
Magazine 1,000 2,700 4,548 5,000
Sale of
Tutorial
Syllabuses 700 2,400 4,616 5,000
Sale of
Proceedings 13,644 14,500 22,647 25,000
Proceedings
Page Over-
run 3,600 3,600 6,900 6,900
Total Revenues 18,944 23,200 38,711 41,900
W. Kaufmann
Proceeding
Printing ( 8,612) (7,000) ( 9,849) (10,000)
Postage ( 1,162) ( ) ( 0) ( 0)
Proceedings
Reprinting ( 3,491) (9,918) ( 8,455) (10,000)
ICJAI Reim-
bursement* 0 0 ( 8,241) ( 0 )
AAAI Labor (2,258) (2,300) ( 2,269) ( 3,540)
Office Exp. (1,243) ( 115) ( 842) ( 1,122)
Total Expenses (16,766) (19,333) (29,656) (24,662)
PUBLICATION,
GROSS MARGIN 2,178 7,167 9,055 17,238
* New entry
7
!
AAAI sponsored Worshops
Actual Budget
1983 1984
No. 1: Non-Monotonic Reasoning
Workshop
Allocation of AAAI-83 Conference
Registration Fees 5,000 4,639
Graphics,Typsetting (128)
Copying (231)
Travel (2,319)
Facilities (2,319)
No. 1,
Gross Margin 4,639.71 0
No. 2: Natural Language Generation
Workshop, CSLI
Allocation of AAAI-83 Conference
Registration Revenues 5,000
Grant to CSLI (5,000)
No. 2, Gross Margin 0
No. 3, Natural Language Understanding
and Logic Programming, IRISA
Allocation of AAAI-83 Conference
Registration Revenues 2,000
Grant to IRISA (2,000)
No.3, Gross Margin 0
-8-
!
IJCAI-85 Conference
[ The AAAI and the ICJAI organization are discussing the
specific duties and tasks associated with the preparation
and conduct of IJCAI-85. Hence, this very sketchy outline.]
Actual Budget
1983 1984
Registration fees 0 0
Total Revenues 0 0
Travel (140) (300)
Printing ( 28) ?
Total Expenses (168)
IJCAI-85, gross
margin (168)
-------
∂26-Mar-84 1202 CLT
did you call okner?
∂26-Mar-84 1332 DFH
I have a doctor's appointment at 4, so plan to leave at
3:45. Forgot to mention it to you earlier.
∂26-Mar-84 1413 PHY
∂26-Mar-84 1348 JMC
May I have 2:30 tomorrow with Tsichritzis?
--
I've already made an appt for that time...
3:00 is all that is left
or 12:00
Faculty lunch is at 12:30
∂26-Mar-84 1506 DEK meeting started at 2:30, can't find you!
∂26-Mar-84 2251 HST
hi.how are you? i'll send you an intersting report on the new reconstruction
of the east german frontier.
can you help me to get the mail address of J.McDermott (the R1 inventor)?
∂27-Mar-84 1319 CL.BOYER@UTEXAS-20.ARPA Recommendation
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 27 Mar 84 13:18:59 PST
Date: Tue 27 Mar 84 15:18:43-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Recommendation
To: JMC@SU-AI.ARPA
We are up for promotion to full professor. Would you be
willing to serve as a reference for either or both of us?
Thanks,
Bob Boyer and J Moore
P.S. We would be happy to send copies of vitas or recent
papers.
-------
Yes, and I would like both.
∂27-Mar-84 1327 LAWS@SRI-AI.ARPA re: fifth generation (from SAIL's BBOARD)
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 27 Mar 84 13:27:28 PST
Date: Tue 27 Mar 84 11:03:49-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: re: fifth generation (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
Reply-To: AIList-Request@SRI-AI
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 22 Mar 84 19:58:00-PST
Would you like me to pass along a copy of your fifth generation review,
or just an anouncement of its published form?
-- Ken Laws
-------
As you wish. If you wish to copy it, the file is fifth[e83,jmc].
∂27-Mar-84 1336 PACK@SU-SCORE.ARPA Office, next quarter
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 27 Mar 84 13:35:49 PST
Date: Tue 27 Mar 84 13:31:47-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Office, next quarter
To: jmc@SU-AI.ARPA
I have been assigned a desk in room 450, since there didn't appear to
be any space on the fourth floor. Do you know how hard it is to get a
sail terminal for a particular desk?
I am going to Yosemite during the latter part of this week, but will
be back on Monday. Can we meet then to talk about what you would like
me to do?
- Leslie
-------
I'll see what I can do about a SAIL terminal for your desk. Also we
can lend you a SAIL terminal for home if you want.
∂27-Mar-84 1400 JMC*
docdil copies to Susie.
∂27-Mar-84 1657 DFH Dahl expenses
Should your share be from your unrestricted or NSF?
Make it NSF.
∂27-Mar-84 2238 LENAT@SUMEX-AIM.ARPA Citations of me
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 27 Mar 84 22:38:03 PST
Delivery-Notice: While sending this message to SU-AI.ARPA, the
SUMEX-AIM.ARPA mailer was obliged to send this message in 50-byte
individually Pushed segments because normal TCP stream transmission
timed out. This probably indicates a problem with the receiving TCP
or SMTP server. See your site's software support if you have any questions.
Date: Tue 27 Mar 84 22:35:20-PST
From: Douglas Lenat <LENAT@SUMEX-AIM.ARPA>
Subject: Citations of me
To: BUCHANAN@SUMEX-AIM.ARPA, FEIGENBAUM@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
cc: lenat@SU-SCORE.ARPA
Bruce (and John and Ed),
As Ed suggested, I looked up myself and others in AI in the
Compumath Citation Index (which is the relevant specialization of
the Science Citation Index) in our library. Harry Lull was
quite helpful in this, by the way. Anyway, here are the results.
I come out favorably according to this measure, compared to almost
everyone. There are some exceptions (textbook-writers and
Randy Davis, in particular). If you want to use some or all of
this data in the papers or future dealings with the dean, please
feel free to do so. This index is only one database, albeit
the most relevant to AI. In another DB, the Social Science one,
there another 49 citations of my work (1975-84), for instance.
Below, I have reported all citations, in the years shown, for
articles and books which were written after 1974.
AUTHOR 1976-1980 1981 1982 1983 (up to 9/83)
Lenat, D 21 11 11 30
Barstow, D 12 7 9 12
Binford, T 4 12 5 6
Brown, J S 41 3 8 6
Buchanan, B 20 11 7 9
Carbonell, J 6 9 4 5
Charniak, E 31 10 7 9
Davis, R 50 19 24 49
Feigenbaum, E 15 7 10 14
Genesereth, M 2 0 0 6
Goldstein, I 13 26 7 8
Hewitt, C 30 11 10 12
Kant, E 6 1 2 5
Langley, P 4 2 1 1
Lehnert, W 10 5 4 1
McCarthy, J 13 5 10 9
McDermott, J 6 3 3 7
Michalski, R 12 5 5 12
Mitchell, T 3 4 6 7
Newell, A 6 6 12 11
Nilsson, N 8 15 7 27
Reddy, D Raj 52 3 10 10
Stefik, M 3 9 7 4
Suppes, P 25 7 4 4
Winograd, T 15 15 13 13
Keep in mind that this is only citations of post-1974 works
(so Nils' early books, and N&S's Human Problem Solving, e.g.,
are not included here), since MY paper publishing begins in 1975.
Also keep in mind that this is only CS-related publications; if
one searches the Social Science data base with the same people,
there some dramatic changes (e.g., Winograd and Suppes gain about
500 citations, many people on the list gain 0, and Lenat gains 49).
It is also worth noting the upward trend in my citations, which
I expect will continue a few more years (at least!) due to the
forthcomingpublication of Nature of Heuristics IV in AIJ, and the
Sci. American Articles (which raise publicity if not direct citations),
and due to the fact that many of my publications were in the last
12-18 months, so haven't been cited yet by those who will eventually
do so. A final note: this is all the data I collected, these aren't
a selected set to make me look good. E.g., I really wish I hadn't
looked Randy up! I intentionally did not look Winston up, because
I expected almost all his citations would be to textbooks and
the Computer Vision book he edited, and the MIT AI Lab reports he
edited. I also didn't look Simon up; that was simply an oversight.
I could look up more people, now that I think of it
(Stan Rosenschein, Johann deKleer,...), but the list above
gives a representative sampling of AI, young AI, and machine
learning researchers. I was disappointed in my listing, until
I saw everyone else's. Of course our conference proceedings,
even though refereed, don't get entered, or we'd all have
many times as many citations.
Cheers,
Doug
-------
∂27-Mar-84 2243 FEIGENBAUM@SUMEX-AIM.ARPA Re: Citations of me
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 27 Mar 84 22:43:07 PST
Date: Tue 27 Mar 84 22:42:40-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: Citations of me
To: LENAT@SUMEX-AIM.ARPA, BUCHANAN@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
In-Reply-To: Message from "Douglas Lenat <LENAT@SUMEX-AIM.ARPA>" of Tue 27 Mar 84 22:35:30-PST
Doug, that's good data and very impressive re your case.
Ed
-------
∂28-Mar-84 0927 perlis%umcp-cs.csnet@csnet-relay.arpa Re: determinism and choice
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 28 Mar 84 09:27:12 PST
Received: by csnet-relay via umcppo; 28 Mar 84 12:11 EST
Date: 28 Mar 84 11:57:52 EST (Wed)
From: Don Perlis <perlis%umcp-cs.csnet@csnet-relay.arpa>
Subject: Re: determinism and choice
To: John McCarthy <JMC%su-ai.arpa%csnet-relay.csnet@csnet-relay.arpa>,
phil-sci%oz%mit-mc.arpa%csnet-relay.csnet@csnet-relay.arpa
From: John McCarthy <JMC%su-ai.arpa@csnet-relay.csnet>
Subject: determinism and choice
I am most in sympathy with the point of view expressed by DAM. It is
expressed more elaborately in McCarthy and Hayes, "Some Philosophical
Problems from the Standpoint of Artificial Intelligence", Machine
Intelligence 4. The essence is that what a person or machine
CAN DO is determined by its position in the interaction structure
rather than by its internal structure. The latter determines what
it will do. This general idea is variously decorated in the paper.
I agree with DAM and with McCarthy on free willl and choice, although I think
DAM's statement (I wish I could excerpt it here, but I let it disappear a few
days ago) while more informal than JMC's also thereby catches a twist that
the McC and Hayes approach may miss, namely, that the internal structure
itself can be a crucial factor in what is a possible choice. For instance,
suppose I have an inherent incapacity to jump higher than 4 feet. This then
is a factor of importance in my deciding whether a plan involving jumping
is feasible. If the jump required is less than 4 feet, I may still consider
it in the realm of things open to me to do; but otherwise not (assuming I
have such knoweledge about my juimpoing limitations). Since it appears that
often we do and often we do not have such knowledge, then the choice set
should perhaps be defined in terms of ones explicit knowledge, in general,
rather than in terms of interanl versus external data. After all, it may
be that in fact I cannot even jump 2 feet due to unknown factors ( I may have
injured may leg and not realize it, or the floor may be to soft to support
a vigorous leap) and still a 3 foot jump may be (appropriately, as far as
I can be expected to know) one of the 'choices' I entertain.
"phil-sci%oz"@mc,"perlis%umcp-cs.csnet"@csnet-relay
determinism and choice
McC and Hayes suggests treating the phenomenon mentioned by Perlis as follows.
Regard the brain, (or perhaps better the mind, since the form of physical
implementation is not relevant) as composed of interacting parts. What one
part can do depends on its position in the causal structure, and this takes
into account the other parts. For example, the folk psychology decomposition
of the mind into Will and Intellect works pretty well for
Perlis's example of jumping provided we add the Body as a part. Namely,
the Body can jump 4 feet, because it has outputs that would do it. However,
if the Will tells the Intellect to do it, the Intellect won't emit the
required order to the Body, so the Will can't. This may not be quite right,
but we will have to provide our robot programs with some kind of
notion of CAN based on interaction structure so that it will explore its
options and decide what to do in some reasonable way.
∂28-Mar-84 0947 ullman@diablo Re: More on Marek paper.
Received: from SU-HNV.ARPA by SU-AI.ARPA with TCP; 28 Mar 84 09:47:34 PST
Date: Wed, 28 Mar 84 09:45 PST
From: Jeff Ullman <ullman@diablo>
Subject: Re: More on Marek paper.
To: JEF@Sail, JMC@Sail
I got a note from you on the "Marek" paper.
Probably there were previous messages that got lost because of the
diablo crash (jef@sail forwards to diablo)
Can you go over this again?
I had a question about database notation, specifically what does X →→ Y
mean, but ARK answered it for me. The Marek paper purports to provide a
proper semantics for the McDermott-Doyle non-monotonic logic using
model-theoretic forcing, but this seems to me a bit like using a
sledge hammer to kill a fly, since forcing really gets its power in
infinite domains. Marek takes his examples from database theory. If
you're interested, I can supply a copy of the Marek note. You need
a computer like SAIL that takes regular disk dumps. I haven't
permanently lost a file since 1969.
∂28-Mar-84 1028 LAWS@SRI-AI.ARPA
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 28 Mar 84 10:28:12 PST
Date: Wed 28 Mar 84 10:29:56-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
To: JMC@SU-AI.ARPA
Reply-To: AIList-Request@SRI-AI
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 27 Mar 84 22:41:00-PST
Thanks. I read the file before contacting you. I'll strip out a few
formatting commands, justify the text, and take your notes off the end
before I pass it along.
-- Ken
-------
∂28-Mar-84 1058 ullman@diablo
Received: from SU-HNV.ARPA by SU-AI.ARPA with TCP; 28 Mar 84 10:58:07 PST
Date: Wed, 28 Mar 84 10:55 PST
From: Jeff Ullman <ullman@diablo>
To: JEF@Sail, JMC@Sail
I'm leaving tomorrow, so I doubt I'd get to look at the paper.
Gabi Kuper might be interested, since he looked at McDermott's
work as a way to define database updates (but didn't get anywhere).
By the way, the problem with diablo was a bit more interesting.
In principle, SUMEX, which runs it, takes dumps every other day.
However, the guy they hired to do the job was simply labeling
tapes with the date and not doing the dump.
I'm not sure, but I think any suggestions on how to make the
punishment fit the crime would be welcomed by Ed Pattermann.
∂28-Mar-84 1331 ME DM
∂28-Mar-84 1112 JMC Feferman terminal
I took it from him and have it at home (in addition to my own). Carolyn
will use it for a while.
ME - OK. Thanks. I've recorded that.
∂28-Mar-84 1434 SJG employment
Dear John:
I have indeed applied to the department of education; could you send them
a letter saying whatever? The person to contact is Decker F. WAlker, Chair,
AI & Education Search, School of Education, Stanford. Many thanks for
whatever you feel you can do.
Matt
∂28-Mar-84 1648 @MIT-MC:Hewitt@MIT-OZ determinism and choice
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 28 Mar 84 16:48:19 PST
Received: from MIT-APIARY-7 by MIT-OZ via Chaosnet; 28 Mar 84 19:10-EST
Date: Wed, 28 Mar 84 19:12 EST
From: Carl Hewitt <Hewitt%MIT-OZ@MIT-MC.ARPA>
Subject: determinism and choice
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: phil-sci%MIT-OZ@MIT-MC.ARPA, Hewitt%MIT-OZ@MIT-MC.ARPA
In-reply-to: The message of 28 Mar 84 04:23-EST from John McCarthy <JMC at SU-AI>
Return-path: <Mailer@MIT-XX>
Received: from MIT-MC by MIT-OZ via Chaosnet; 28 Mar 84 05:25-EST
Date: 28 Mar 84 0123 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: determinism and choice
To: phil-sci%oz@MIT-MC.ARPA
I am most in sympathy with the point of view expressed by DAM. It is
expressed more elaborately in McCarthy and Hayes, "Some Philosophical
Problems from the Standpoint of Artificial Intelligence", Machine
Intelligence 4. The essence is that what a person or machine
CAN DO is determined by its position in the interaction structure
rather than by its internal structure. The latter determines what
it will do. This general idea is variously decorated in the paper.
Good point. However, the uncertainty principle of quantum mechanics
would seem to limit the extent to which the interaction structure
determines what a system will do. It may be that the macroscopic behavior
of people is not much affected by quantum level effects. But I don't know any
good arguments why this should be the case.
--Carl
∂28-Mar-84 1721 PACK@SU-SCORE.ARPA Terminals
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Mar 84 17:21:02 PST
Date: Wed 28 Mar 84 17:18:27-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Terminals
To: jmc@SU-AI.ARPA
I need to go home soon, but I have written my name on the white-board
in my cubby-hole in 450. It is approximately in the center of the
room.
I would like to take a sail terminal (datamedia, I presume?) home if
it's available. I have a 1200 baud modem.
- Leslie
-------
∂28-Mar-84 1731 @MIT-MC:DAM@MIT-OZ determinism and choice
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 28 Mar 84 17:31:24 PST
Date: Wed, 28 Mar 1984 19:19 EST
Message-ID: <DAM.12003053082.BABYL@MIT-OZ>
From: DAM%MIT-OZ@MIT-MC.ARPA
To: JMC%MIT-OZ@MIT-MC.ARPA
cc: phil-sci%MIT-OZ@MIT-MC.ARPA
Subject: determinism and choice
Date: Wednesday, 28 March 1984 04:23-EST
From: John McCarthy <JMC at SU-AI.ARPA>
I am most in sympathy with the point of view expressed by DAM.
It is expressed more elaborately in McCarthy and Hayes, "Some
Philosophical Problems from the Standpoint of Artificial
Intelligence", Machine Intelligence 4.
Woops, I should have remembered that (I read that one a long
time ago).
∂29-Mar-84 0620 ABOULANGER@BBNG.ARPA Re: determinism and choice
Received: from BBNG.ARPA by SU-AI.ARPA with TCP; 29 Mar 84 06:20:19 PST
Date: Thu 29 Mar 84 09:20:32-EST
From: Albert Boulanger <ABOULANGER@BBNG.ARPA>
Subject: Re: determinism and choice
To: hewitt%oz@MIT-MC.ARPA
cc: phil-sci%oz@MIT-MC.ARPA, jmc@SU-AI.ARPA
In-Reply-To: Message from "Carl Hewitt <Hewitt at MIT-OZ>" of Wed 28 Mar 84 19:15:33-EST
Good point. However, the uncertainty principle of quantum
mechanics would seem to limit the extent to which the
interaction structure determines what a system will do. It may
be that the macroscopic behavior of people is not much affected
by quantum level effects. But I don't know any good arguments
why this should be the case.
There is a good reason for quantum effects not being present at
the scale we live in. The group statistics washes them out. The
exact behavior of the ensemble depends on the statistics:
Bose-Einstein
Fermi-Dirac
Maxwell-Boltzman
Typical everyday ensembles obey Maxwell-Boltzman (I think) in
which many of the quantum effects are washed out. (However other
ensembles such as super-conducting materials obey other
statistics (Fermi-Dirac?) in which some of the quantum effects
are shown by the ensemble.
Albert Boulanger
-------
∂29-Mar-84 0636 perlis%umcp-cs.csnet@csnet-relay.arpa Re: determinism and choice
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 29 Mar 84 06:36:39 PST
Received: by csnet-relay via umcppo; 29 Mar 84 9:22 EST
Date: 29 Mar 84 09:11:07 EST (Thu)
From: Don Perlis <perlis%umcp-cs.csnet@csnet-relay.arpa>
Subject: Re: determinism and choice
To: John McCarthy <JMC%su-ai.arpa%csnet-relay.csnet@csnet-relay.arpa>,
phil-sci%oz%mit-mc.arpa%csnet-relay.csnet@csnet-relay.arpa,
perlis%umcp-cs.csnet%csnet-relay.csnet@csnet-relay.arpa
From: John McCarthy <JMC%su-ai.arpa@csnet-relay.csnet>
Subject: determinism and choice
...Regard the brain... as composed of interacting parts. What one
part can do depends on its position in the causal structure, and
this takes into account the other parts. For example, the folk
psychology decomposition of the mind into Will and Intellect works
pretty well for Perlis's example of jumping provided we add the Body
as a part. Namely, the Body can jump 4 feet, because it has outputs
that would do it. However, if the Will tells the Intellect to do
it, the Intellect won't emit the required order to the Body, so the
Will can't. This may not be quite right, but we will have to
provide our robot programs with some kind of notion of CAN based on
interaction structure so that it will explore its options and decide
what to do in some reasonable way.
I'm not sure I follow this. My point was that the reasoning mechanisms
themselves must be included, in some cases, as part of the 'causal
interaction structure,' and that no part of it is immune from this. As
a consequence, self-reference might be required. This struck me as at
least implicit in DAM's original comments. Self-reference here is not
just of one part to another, but of one part to *itself*, e.g. the
intellect may know its *own* limitations, such as to reason fast enough
to find a solution to a certain kind of problem before its too late.
As for JMC's statement about the body being able to jump 4 feet, even if
the will and the intellect are prepared to emit such orders, the body
still may fail for physical reasons; if the intellect is aware of these
limitations, it (the intellect) may still order the motion (say in
desperation), yet we wouldn't want to say that the body (or the individual)
was then capable of the impossible jump, or even that the individual thought
itself so capable, I think.
I don't believe that this presents insurmountable problems for the McC&Hayes
account; but it does strike me as a point worth separate mention.
--Don Perlis
∂29-Mar-84 0900 JMC*
Polson 303 492-6991
∂29-Mar-84 1858 CL.BOYER@UTEXAS-20.ARPA Re: 1980 lisp conference proceedings
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 29 Mar 84 18:58:17 PST
Date: Thu 29 Mar 84 20:57:25-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Re: 1980 lisp conference proceedings
To: JMC@SU-AI.ARPA
cc: dwise.Oregon-State@CSNET-RELAY.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 29 Mar 84 14:14:00-CST
I certainly will do my best to get them reprinted. In the first
case, I have asked David Wise to look into the matter. He seems
to know a lot more people at ACM than I do.
-------
∂29-Mar-84 1956 CL.BOYER@UTEXAS-20.ARPA Texas
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 29 Mar 84 19:55:57 PST
Date: Thu 29 Mar 84 21:55:43-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Texas
To: jmc@SU-AI.ARPA
Because of his new MCC duties, Woody has resigned as
chairman of the committee at the University of Texas that is
trying to fill new chairs.
The new chairman of the committee is Mani Chandy, who is
also chairman of the CS department.
Mani has asked me to talk with you about the idea of your
coming to Texas. I believe that at some point, your and
Carolyn's visiting for a week was discussed, but not much
has been said for months. Are you interested? It's my
guess that you don't have the time or interest right now,
but it would be good (good for us) to hear whether
you are interested in a visit.
I am not on the search committee, but it is my understanding
that you are the only one of the first ten people that UT
approached who has not given a definite signal. Dijkstra
has accepted, and the others have said "No" or "Not now".
You should definitely understand that a "Not now" is a
signal that you could give and yet still reopen the subject
later. Mani indicated that even if the current positions
were filled, a chair for someone like you could be created
if you ever became interested.
On a more scientific plane --
An Indian student named Shankar has been using our
theorem-prover to do some proofs in metamathematics. He has
formalized Shoenfield's logic as a collection of functions
in our theorem-prover's theory and has proved a number of
Shoenfield's proof-theory theorems. The most interesting is
a proof that for any "tautology" one can give a proof
(grinding everything out with modus ponens, etc.). He has
been working on the famous theorems of Goedel and Church.
It is a surprise to me that in the case of Goedel's first
theorem on unprovable statements, the easy part, from the
point of view of proof checking, is that which is commonly
regarded as the heart of the argument. The hard (long,
anyway) part however is the tedious business of showing that
any primitive recursive function can be imitated from within
an elementary set theory or number theory.
Moore and I have almost finished constructing a version of
our system that handles bounded quantification. One
interesting proof was that of the Binomial Theorem, where
sigma manipulation is standard.
-------
I'm not sure how interested I am, but what is holding up our
visit is reluctance on Carolyn's part to take the time.
∂30-Mar-84 0236 DEK party
To: "@FACULT.DIS[1,DEK]"@SU-AI.ARPA
Since nobody dropped their food all over the floor last Monday, I've
decided to have another dinner party.
This one will be in honor of Nils Nilsson's visit to our department,
as the second of the three ``finalists'' in our search.
More details will follow, but please reserve the date now if you can:
Monday, April 9, at 1063 Vernier Place, beginning at 6pm.
You and spouse/friend are invited for dinner and conversation.
∂30-Mar-84 0704 SCHREIBER@SU-SCORE.ARPA Meeting plan
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Mar 84 07:04:24 PST
Date: Fri 30 Mar 84 06:57:17-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Meeting plan
To: schreiber@SU-SCORE.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Our first meeting will take place April 10 (Tuesday) at 12:15PM
Agenda:
12:15-12:30 -- eat lunch
12:30-1:00 discuss AA questions
1:00-4:30(?) -- discuss remaining sections
The faculty lunch that day will last until 1:00ish. Nils Nilsson will be
there. So I expect that some faculty members of the committee will
be at the faculty lunch. I've scheduled the AA section because Dave
Foulser and I will be present to defend it and enough student and faculty
members will be around to attack it.
Rob
-------
∂30-Mar-84 0707 SCHREIBER@SU-SCORE.ARPA AI Reading list
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Mar 84 07:07:22 PST
Date: Fri 30 Mar 84 07:04:29-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: AI Reading list
To: mwalker@SU-SCORE.ARPA
cc: lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA
You may announce to the students that they may study either the AI Handbook
or the book "Artificial Intelligence," by Elaine Rich, to prepare for the
AI Section of the comp this spring. Will you take care of making the
announcement.
Rob
-------
∂30-Mar-84 0900 JMC*
ai comp
∂30-Mar-84 0942 JK
∂29-Mar-84 2314 JMC serious bug
Page 2 of bird.lsp[w84,jmc] runs. The last step is wrongly accepted.
------
This has been fixed. The decision procedure thought that BIRDS was a
unfiable variable - caused by a change I made two weeks ago on the
way dependencies of a line are calculated.
∂30-Mar-84 0957 perlis%umcp-cs.csnet@csnet-relay.arpa Re: reference
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 30 Mar 84 09:57:48 PST
Received: by csnet-relay via umcppo; 30 Mar 84 12:48 EST
Date: 30 Mar 84 12:11:26 EST (Fri)
From: Don Perlis <perlis%umcp-cs.csnet@csnet-relay.arpa>
Subject: Re: reference
To: John McCarthy <JMC%su-ai.arpa%csnet-relay.csnet@csnet-relay.arpa>,
perlis%umcp-cs.csnet%csnet-relay.csnet@csnet-relay.arpa
Cc: dam%oz%mit-mc.arpa%csnet-relay.csnet@csnet-relay.arpa
The anthology, "Free Will and Determinism" edited by Bernard Berofsky
(Harper and Row, 1966) contains several such papers.
In particular, the papers of Hobart and Foot address this very question,
Hobart on 'our' side, and Foot against. Both give some additional
references, esp. Foot. Also, John Stuart Mill in the same volume has
an essay with a broadly sympathetic outlook. The papers of Davidson and
MacIntyre are of interest as well.
Finally, Austin goes into 'choosing' at great length, at times bordering
on statements similar to DAM's, I think, but I have not examined the
former with any care.
--Don P.
∂30-Mar-84 1045 REM XGP/Boise output now alphabetized by last name, not PPN
You have waiting output in the M (not J) bin in XGP/Boise room,
don't forget to look for it.
∂30-Mar-84 1522 RPG macro
There seems to be a bug in the interface which prevents me from creating the
macro. There is an E feature to wait for some lines from Lisp, but it doesn't
work. I'll have to talk to Frost..
-rpg-
∂31-Mar-84 0853 JK
∂30-Mar-84 2329 JMC stuck again
bird.lsp is the file. p.2 contains the commands, p.3 contains
the result of running the commands up to step 20 which
gets PDL overflow. Why this step should give problems isn't
at all clear. The steps beyond ;foo are debris left over
from a previous attempt that got beyond step 20 but had a
wrong 20. Namely, the ¬ on ab2 was omitted.
----------
This is in the internals of derive - It would be better if you could
get around this since I am planning to redo the whole thing in the
near future anyway; I would prefer not to touch it too much.
∂31-Mar-84 1423 GOLUB@SU-SCORE.ARPA Agenda
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 Mar 84 14:23:46 PST
Date: Sat 31 Mar 84 14:20:34-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Agenda
To: walker@SU-SCORE.ARPA, reid@SU-SCORE.ARPA, bosack@SU-SCORE.ARPA,
bscott@SU-SCORE.ARPA, buchanan@SU-SCORE.ARPA, jmc@SU-AI.ARPA,
regES@SU-SCORE.ARPA, cheriton@SU-SCORE.ARPA, tob@SU-AI.ARPA
Please note I have included you on the Agenda for Tuesday. I tried to contact
many of you but was unable to do so. If you object, I can eliminate you from the
program. GENE
-------
∂31-Mar-84 1635 FEIGENBAUM@SUMEX-AIM.ARPA [Ed Pattermann <PATTERMANN@SUMEX-AIM.ARPA>: Notes from talk by Alan Kay]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 31 Mar 84 16:35:22 PST
Date: Sat 31 Mar 84 16:34:59-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [Ed Pattermann <PATTERMANN@SUMEX-AIM.ARPA>: Notes from talk by Alan Kay]
To: jmc@SU-AI.ARPA, nii@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA,
brown@SUMEX-AIM.ARPA
Mail-From: PATTERMANN created at 31-Mar-84 09:09:44
Date: Sat 31 Mar 84 09:09:44-PST
From: Ed Pattermann <PATTERMANN@SUMEX-AIM.ARPA>
Subject: Notes from talk by Alan Kay
To: sumex-staff@SUMEX-AIM.ARPA, feigENBAUM@SUMEX-AIM.ARPA,
rindFLEISCH@SUMEX-AIM.ARPA, shortLIFFE@SUMEX-AIM.ARPA
For your reading pleasure ;
-----
Date: 23 Mar 1984 1214-EST (Friday)
From: mit-athena!dm@mit-eddie (Dave Mankins )
Subject: Notes from talk by Alan Kay at MIT
Dr. Alan Kay, one of the developers of Smalltalk and the Xerox Alto, and
currently a Vice President and Chief Scientist at Atari, gave a talk at
MIT yesterday (22 March 1984) titled: "Too many smart people: a personal
view of design in the computer field"
The abstract:
This talk is about the battle between Form and Content in Design and
why "being smart" ususally causes content to lose. "Insightful
laziness" is better because (1) it takes maximum advantage of others
work and (2) it encourages "rotating" the problem into its simplest
essence -- often by changing it completely. In other words: Point
of view is worth 80 IQ points!
Here are some tidbits gleaned from my notes:
One of the problems with smart people is that they deal with
difficulties by fixing them, rather than taking the difficulty as a
symptom of a flaw in the design, and noticing "a rotation into a new
simplicity."
When preparing his talk he realized that what he wanted to say was
basically inconsistent, that
1) You should do things over, and
2) You shouldn't do things over.
"Both of these are true as long as you get the boundary conditions
right." (There ensues an anecdote about working with Seymour Cray to
get an early CDC6500 up at NCAR. The 6500 hardware did not normalize
its floating point operations, but that was "okay" because "any sensible
model will converge". When the NCAR meteorologists (who answer the
question "what will the weather be like?" by looking out the window)
tried to put their models up on the CDC6500, they didn't work. They
insisted that the Fortran compiler do the normalization for them. Kay
cited this as evidence that their model was wrong. Hmph, it's easy to
make fun of meteorologists...)
Kay cited Minsky's Turing award lecture, in the Apr. 1970 JACM (or maybe
CACM, I didn't catch it): "Form and content aren't enough." What has
happened to the computer science field over the last twenty years is
myopia: "a myopia so acute that only the very brilliant can achieve
it."
As an example of this, Kay cited the decline from the STS940 in 1965 to
UNIX ("a mere shadow of what an operating system should be") to CPM. The
myopia in question is best illustrated by a failure of Kay's own: "When
we got our first IMSAI (mumble) we put Smalltalk up on it. We had to do
a lot of machine coding on it, and we thought that wasn't right. And it
performed about as well as BASIC does today. We said 'This is clearly
inadequate. What we need is 2Mb of memory and a fast disk.' Thus we
left the door open for BASIC to crawl back out of its crypt."
He should be lynched. At least he realizes the error of his ways.
He cited an article by Vannevar Bush, in a 1945 Atlantic Monthly,
titled, "As we may think", in which Bush described a multi-screened,
pointer-based system with access to the world's libraries, drawing
programs, etc. Bush, of course, thought it was just a few years away
(he called it "Memex").
He alluded to Minsky's notion of "science-envy": Natural scientists look
at the universe and discover its laws. Computer scientists make up
their universes. "What we do is more like an art." "You can judge
whether or not a field is overcome by science-envy if it sticks the word
'science' into its name: 'computer science', 'cognitive science',
'political science'..."
He talked about some of his early work, with Ed Teitel, developing an
early personal computer (ca. 1965) calligraphic display with a pointer.
It had "a wonderful language I developed, influenced by Sutherland's
Sketchpad (the best thesis ever done in computer science) and
Simula--everything I've ever done has been influenced by Sketchpad and
Simula). Everyone who tried to use it hated it. They all had about the
same reaction to it that everyone has to APL today." Shortly after
working on this he saw Papert's work with LOGO and children, and
resolved that everything he did from that day forth would be
programmable by children.
Part of the machine's problem stemmed from the fact that it didn't have
enough memory. This in turn stems from the fact that we cast hardware
in concrete before we know what we're going to do with it.
Some relevant maxims from my notes:
"Hardware is software crysallized early."
"We shouldn't try to build a supercomputer until we have something
to compute."
His point in these two maxims was, I think, that we're very good at
building hardware before we really know what we're going to do with it
(is there a lesson here for Project Athena with its tons of Ethernetted
VAXes "which will be used for undergraduate education" but a lack of
vision when it comes to educational software?)
He then described the Dynabook: a note-book sized interactive computer,
with about the same kind of interface as a notebook: you can doodle with
it, scribble, but it can also peruse the whole Library of Congress, as
well as past doodles. "So portable you can carry something else, too."
[For a more complete description of Dynabook, see ``Fanatic Life and
Symbolic Death among the Computer Bums'', in "Two Cybernetic Frontiers"
by Stewart Brand.]
[An aside: one of the proposed forms of the Dynabook was a Walkman with
eyeglass flat-screen stereoptic displays (real 3-d complete with hidden
surfaces!). This was punted because "no one would want to put something
on their head." (Times change.) Kay asserted that such displays ought
to be easier to produce than a note-book sized display, since there
would be fewer picture-elements required (a notebook would require maybe
1.5M pixels, while "the human eye can resolve only 140,000 points, so
you'd only have to put 140,000 pixels into your eyeglasses". The flaw
in this argument is that most of those points the eye can resolve are in
the fovea, and you would have to put foveal-resolution over the entire
field of the glasses, meaning, more pixels. This is the opposite of
window-oriented displays. Instead of a cluttered desk you have an
orderly bulletin-board: just display everything at once, the user
can look around the room at all the stuff. If this room isn't enough
you can walk into the next room and look at more stuff.]
More maxims:
"Great ideas are better than good ones because they both take about
the same amount of time to develop and the great ideas aren't
obsolete when you're done."
An observation:
"In all the years that we had the Altos no one at Xerox ever
designed anything by starting with a drawing on an Alto. They
always started with a sketch on the back of an envelope."
Nicholas Negroponte and the Architecture Machine (ArcMac) group
did the only study of what sketching is and what really is going
on when you sketch in 1970 in a project called "Architecture by
yourself" but their funding dried up and no one remembers that
stuff now.
[An aside: the Macintosh's MacPaint program is the best drawing
program that Kay has ever seen. (The Macintosh people called him
up one day and said, "Come on over, we have a present for you.")
When he started playing with it he had a two-fold reaction:
"Finally", and "Why did it take 12 years?"]
Homage was paid to the Burroughs B5000, a computer developed in 1961:
It's operating system was entirely written in a higher level
language (ALGOL)
It had hardware protection (which was later recognized to be
a capability protection system)
It had an object-oriented virtual memory system
It had virtual data
(any data reference could have a procedure attached to it for
fetching and storing the real data--a bit was set as to which
side of the assignment statement it went on)
It was a multiprocessor (it had two processors, and much of the
protection scheme was built in order to allow the two processors
to work together).
It had an integrated stack (which, sadly, is the only thing that
people seem to remember).
"This was twenty years ago! What happened, people?"
The B5000 had some flaws:
The virtual data wasn't done right
there were too many architectural assumptions about physical data
formats
"Char mode: which eliminated all the protections." This was
provided to let programmers used to the 1401 (I think) be
comfortable.
User interface observations:
Piaget's three stages of development:
Doing ----> Images -----> Symbols
doing: "a hole is to dig"
images: "getting the answer wrong in the water glass experiment"
symbols: "so we can say things that aren't true"
Brunner did a study that indicated these weren't stages, they were three
areas conflicting for dominance--as we mature, symbols begin to win out.
Ha...man did a study of inventiveness and creativity among
mathematicians and discovered that most mathematicians do their work
imagistically, very few of them work by manipulating symbols. Some
mathematicians (notably Einstein) actually have a kinesthetic ability to
FEEL the spaces they are dealing with.
From psychology comes a principle applicable to user interfaces:
Kay's law: Doing with Images generates Symbols.
He cites Papert's "Mindstorms", where Papert describes programming a
computer to draw a circle. A high school student, working with BASIC
would have before her the dubious assertion that a circle and
x**2+y**2=C are related. A child, instructed to "play turtle" will
close her eyes while walking in a circle and say "I move forward a
little, then I turn a little, and I keep doing that until I make a
circle". This is how a differential geometer views a circle. Papert's
whole book is an illustration of Kay's Law.
User interface maxims:
Immediacy
What you see is what you get (WYSIWYG)
Modeless
Always be able to start a new command without having to clean up
after the old one.
Generic
What works in one place works in another
User illusion
User's make models of what goes on inside the machine. Make the
system in which most of the user's guesses are valid. Not "some
of the time it's wonderful, but most of the time you get
surprised."
Communicative
He drew the distinction between reactive systems and interactive
systems. All his systems have been reactive--you would do
something, and the system would react, opening up new
possibilities.
Undoability
Even if it doesn't do much, if you never lose a character, your
users will be happy.
Functional
"What will it do without user programming."
He didn't used to think this was a user interface issue until he
saw the STAR, which has the world's best user interface, except
that it doesn't DO anything. Not many people can affort a 17000
coffee-warmer.
Fun
One should be able to fool around with no goal. A user
interface should be like Disneyland
"Language is an extension of gestures--you're not really trying to say
something, you're really trying to point to something that is in someone
else's head. A good mime can convey a message without a single word."
A model he encourages people to pursue is that of the AGENT. When you
go into a libratry, you don't expect an oracle, you expect someone who
knows how to find what you're looking for. It is much easier to make an
expert about the terrain of knowledge than an expert that can deal with
the knowledge itself.
He then played a videotape of a "telephone answering machine" being
developed by ArcMac (with funding from Atari). It listened to the
pattern of a person's speech (in order to figure out when the person was
pausing long enough to be politely interrupted) and then channelled the
conversation into a context (that of taking a message) that the machine
could deal with. It has a limited speech recognition ability, which
allows its owner to leave messages for other people:
Hello, this is Doug's telephone, Doug isn't in right now, can I tell
him who called?
Uh, Clem...
If you'd like to leave Doug a message, I can give it to him, otherwise
just hang up and I'll tell him you called.
Doug, I'm going to be in town next Tuesday and I'd like to get
together with you to discuss the Memory project....
Thank you, I'll tell him you called.
and
Hello, this is Doug's telephone, Doug isn't in right now, can I tell
him who called?
It's me...
Hi, Doug, you have three messages.
Who are they from?...
One is from UhClem, one is from Joe, and you have a mail message
from Bill about the Future Fair.
Tell me what UhClem has to say...
[The machine plays a recording of Clem's message]
Take a message for UhClem...
Recording.
Dinner next Tuesday is fine, how about Mary Chung's?
And so on. UhClem calls later, and the machine plays back the recording
of Doug's message.
POINT OF VIEW IS WORTH 80 IQ POINTS:
"A couple of years after Xerox punted the Alto, I met the people who
made that decision. They weren't dunces, as I had originally
supposed, they just didn't have the right point of view: they had no
criteria by which to tell the difference between an 8080 based word
processor and a personal computer."
-------
-------
∂31-Mar-84 1803 minker%umcp-cs.csnet@csnet-relay.arpa Bibliography on Non-Monotonic Reasoning
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 31 Mar 84 18:03:22 PST
Received: by csnet-relay via umcppo; 31 Mar 84 20:58 EST
Date: 31 Mar 84 20:50:26 EST (Sat)
From: JACK MINKER <minker%umcp-cs.csnet@csnet-relay.arpa>
Subject: Bibliography on Non-Monotonic Reasoning
To: perlis%umcp-cs.csnet@csnet-relay.arpa,
"uw-beaver!ubc-vision!Reiter"%lbl-csam.arpa@csnet-relay.arpa,
JMC%su-ai.arpa@csnet-relay.arpa
Don Perlis has agreed to your suggestion that someone develop a bibliography
on non-monotonic reasoning in time to be distributed at the Workshop in
October. He will send a message over the ARPA and CS nets requesting
inputs and will request inputs from those who we know are doing work in this
field. Could you send Don any information you have re people or citations
that would be useful. If you would send the names and NET addresses he
will send requests to individuals. Is it possilble to get a notice into
SIGART or the AI Magazine with a request for information?
Don already has a fair sized bibliography and is anxious to expand it for
the Workshop.
Jack
∂01-Apr-84 0816 JK
∂31-Mar-84 2158 JMC rebug
As far as I can see step 27 loses information. See page 4
of bird.lsp[w84,jmc]. Namely, it loses the informtion that
ostriches can't fly. We have ∀x.ostrich x ∧ ¬ab aspect3 x ⊃ ¬flies x,
and ab2, which is substituted for ab is always false on
any aspect3 x.
-------------
Amazing: false∨false was simplified to true due to a typo in the rewriter.
Has been fixed.
Let me know when you have the proof ready - looks like a great debugging file.
∂01-Apr-84 0820 JK
∂31-Mar-84 2050 JMC unbug
I discovered that if I replaced ⊃ by ≡ in the second parts of my axiom 2,
the rewrites work. I thought they were advertised to work for ⊃. I now
have almost the result I want. I only lack showing that ostriches don't
fly even if they are birds. Most likely this is my fault rather than
that of EKL. Thanks for your help.
--------
Implications are interpreted as follows: Use the consequent as a rewrite
if the antecedent can be verified (in the dynamic context)
∂01-Apr-84 0900 JMC*
bottles to Gunthers
∂01-Apr-84 1057 KJB@SRI-AI.ARPA ARea F lunches
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 1 Apr 84 10:57:25 PST
Date: Sun 1 Apr 84 10:58:30-PST
From: Jon Barwise <KJB@SRI-AI.ARPA>
Subject: ARea F lunches
To: csli-di@SRI-AI.ARPA
Several people ahve suggested that it would be a good idea for
the folks in area F to meet regularly for lunch and to discuss
what they are up to. I think we should try this for a while.
M,T,W are fine with me. How about you?
-------